On the Levenshtein Automaton and the Size of the Neighborhood of a Word
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...