Author:
de la Higuera Colin,Janodet Jean-Christophe,Tantini Frédéric
Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii Nauk SSSR 163(4), 845–848 (1965)
2. Navarro, G.: A guided tour to approximate string matching. ACM computing surveys 33(1), 31–88 (2001)
3. Chávez, E., Navarro, G., Baeza-Yates, R.A., Marroquín, J.L.: Searching in metric spaces. ACM Computing Survey 33(3), 273–321 (2001)
4. Kohonen, T.: Median strings. Pattern Recognition Letters 3, 309–313 (1985)
5. Schulz, K.U., Mihov, S.: Fast string correction with Levenshtein automata. Int. Journal on Document Analysis and Recognition 5(1), 67–85 (2002)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning Grammars and Automata with Queries;Topics in Grammatical Inference;2016
2. Grammatical Inference for Computational Linguistics;Synthesis Lectures on Human Language Technologies;2015-10-23
3. Zulu: An Interactive Learning Competition;Lecture Notes in Computer Science;2010
4. Learning Finite State Machines;Lecture Notes in Computer Science;2010
5. Sequences Classification by Least General Generalisations;Grammatical Inference: Theoretical Results and Applications;2010