Jump to content

Talk:Levenshtein automaton

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Older references to levenshtein automata in comp. ling.

[edit]

The concept of levenshtein automata is described slightly differently within computational linguistics, i.e. the actual levenshtein measure encoded as a two-tape automaton (term that I very much prefer over "transducer"). I believe one of the earlier mentions of this is like such in Schulz & Mihov's Fast String Correction with Levenshtein-Automata (2002). I've a bit of bibliography on recent uses as well,but it would be pretentious to add and it is new research I suppose. Flammie (talk) 21:41, 15 August 2012 (UTC)[reply]