用扩展自动机确定两种语言的受限Damerau-Levenshtein编辑距离

Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies Pub Date : 1900-01-01 DOI:10.1109/RIVF.2010.5632914

D. Q. Thang, P. Huy

{"title":"用扩展自动机确定两种语言的受限Damerau-Levenshtein编辑距离","authors":"D. Q. Thang, P. Huy","doi":"10.1109/RIVF.2010.5632914","DOIUrl":null,"url":null,"abstract":"Restricted Damerau-Levenshtein edit-distance is applied in many fields such as language processing, speech recognition, detecting theft of information, biology computation, etc. Modifying from the method of Mehryar Mohri (2003) which uses the composition of transducers combined with a singlesource shortest-paths algorithm to compute Levenshtein editdistance of the two languages, we propose a type of an extended automaton in order to compute the restricted DamerauLevenshtein edit-distance of the two languages. Keywords-Damerau-Levenshtein; edit-distance; extended automaton; algorithm; transducer","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"128 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Determining Restricted Damerau-Levenshtein Edit-Distance of Two Languages by Extended Automata\",\"authors\":\"D. Q. Thang, P. Huy\",\"doi\":\"10.1109/RIVF.2010.5632914\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Restricted Damerau-Levenshtein edit-distance is applied in many fields such as language processing, speech recognition, detecting theft of information, biology computation, etc. Modifying from the method of Mehryar Mohri (2003) which uses the composition of transducers combined with a singlesource shortest-paths algorithm to compute Levenshtein editdistance of the two languages, we propose a type of an extended automaton in order to compute the restricted DamerauLevenshtein edit-distance of the two languages. Keywords-Damerau-Levenshtein; edit-distance; extended automaton; algorithm; transducer\",\"PeriodicalId\":171525,\"journal\":{\"name\":\"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies\",\"volume\":\"128 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIVF.2010.5632914\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF.2010.5632914","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

受限Damerau-Levenshtein编辑距离被广泛应用于语言处理、语音识别、信息盗窃检测、生物计算等领域。在Mehryar Mohri(2003)使用换能器组合和单源最短路径算法计算两种语言的Levenshtein编辑距离的方法的基础上，我们提出了一种扩展自动机来计算两种语言的受限DamerauLevenshtein编辑距离。Keywords-Damerau-Levenshtein;编辑距离;扩展自动机;算法;传感器

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Determining Restricted Damerau-Levenshtein Edit-Distance of Two Languages by Extended Automata

Restricted Damerau-Levenshtein edit-distance is applied in many fields such as language processing, speech recognition, detecting theft of information, biology computation, etc. Modifying from the method of Mehryar Mohri (2003) which uses the composition of transducers combined with a singlesource shortest-paths algorithm to compute Levenshtein editdistance of the two languages, we propose a type of an extended automaton in order to compute the restricted DamerauLevenshtein edit-distance of the two languages. Keywords-Damerau-Levenshtein; edit-distance; extended automaton; algorithm; transducer

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies

自引率

0.00%

发文量