Skip to main content
SpringerLink
Log in

On the Levenshtein Automaton and the Size of the Neighbourhood of a Word

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9618))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The authors write: “We describe only the basic idea”.

References

  1. Baeza-yates, R., Navarro, G.: A faster algorithm for approximate string matching. In: Algorithmica, pp. 1–23 (1996)

    Google Scholar 

  2. Becerra-Bonache, L., de la Higuera, C., Janodet, J.C., Tantini, F.: Learning balls of strings from edit corrections. J. Mach. Learn. Res. 9, 1841–1870 (2008)

    MathSciNet  MATH  Google Scholar 

  3. Holub, J., Melichar, B.: Implementation of nondeterministic finite automata for approximate pattern matching. In: Champarnaud, J.-M., Maurel, D., Ziadi, D. (eds.) WIA 1998. LNCS, vol. 1660, pp. 92–99. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Mihov, S., Schulz, K.: Fast approximate search in large dictionaries. Comput. Linguist. 30(4), 451–477 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Mitankin, P.: Universal Levenshtein automata. Building and properties. Masters thesis, University of Sofia (2005)

    Google Scholar 

  6. Myers, G.: Whats behind blast. In: Chauve, C., El-Mabrouk, N., Tannier, E. (eds.) Models and Algorithms for Genome Evolution, Computational Biology, vol. 19, pp. 3–15. Springer, London (2013)

    Chapter  Google Scholar 

  7. Schulz, K., Mihov, S.: Fast string correction with levenshtein automata. Int. J. Doc. Anal. Recogn. 5, 67–85 (2002)

    Article  MATH  Google Scholar 

  8. Ukkonen, E.: Finding approximate patterns in strings. J. Algorithms 6(1), 132–137 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  9. Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168–173 (1974)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CRIStAL (UMR CNRS 9189 University of Lille) and Inria, Villeneuve-d’Ascq, France

    Hélène Touzet

Authors
  1. Hélène Touzet
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hélène Touzet .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Czech Technical University, Prague, Czech Republic

    Jan Janoušek

  3. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus Liebig University Giessen, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Touzet, H. (2016). On the Levenshtein Automaton and the Size of the Neighbourhood of a Word. In: Dediu, AH., Janoušek, J., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2016. Lecture Notes in Computer Science(), vol 9618. Springer, Cham. https://doi.org/10.1007/978-3-319-30000-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30000-9_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29999-0

  • Online ISBN: 978-3-319-30000-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation