Abstract
Given a word P and a maximal number of errors k, we address the problem of counting the number of strings whose Levenshtein distance to P does not exceed k. We give an algorithm that scales linearly with the size of P and that is based on a variant of the classical Levenshtein automaton.
Cite
CITATION STYLE
APA
Touzet, H. (2016). On the levenshtein automaton and the size of the neighbourhood of a word. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9618, pp. 207–218). Springer Verlag. https://doi.org/10.1007/978-3-319-30000-9_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free