Title :
Determining Restricted Damerau-Levenshtein Edit-Distance of Two Languages by Extended Automata
Author :
Quyet Thang Dang ; Trung Huy Phan
Author_Institution :
Fac. of Inf. Technol., Nam Dinh Univ. of Technol. Educ., Nam Dinh, Vietnam
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 single-source shortest-paths algorithm to compute Levenshtein edit- distance of the two languages, we propose a type of an extended automaton in order to compute the restricted Damerau-Levenshtein edit-distance of the two languages.
Keywords :
automata theory; natural language processing; pattern matching; transducers; Mehryar Mohri; extended automata; language processing; restricted Damerau-Levenshtein edit- distance; single- source shortest-paths; transducers; Algorithm design and analysis; Automata; Complexity theory; Cost function; Finite element methods; Transducers; Transforms;
Conference_Titel :
Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), 2010 IEEE RIVF International Conference on
Conference_Location :
Hanoi
Print_ISBN :
978-1-4244-8074-6
DOI :
10.1109/RIVF.2010.5632914
