Deciding word neighborhood with universal neighborhood automata

  • Authors:

  • Petar Mitankin;Stoyan Mihov;Klaus U. Schulz

  • Affiliations:

  • Institute for Parallel Processing, Bulgarian Academy of Sciences, Block 25A, Acad. G. Bonchev Street, 1113 Sofia, Bulgaria;Institute for Parallel Processing, Bulgarian Academy of Sciences, Block 25A, Acad. G. Bonchev Street, 1113 Sofia, Bulgaria;Centrum für Informations- und Sprachverarbeitung, Ludwig-Maximilians-Universität München, Oettingenstr. 67, 80538 München, Germany

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2011

Quantified Score

Hi-index 5.23

Visualization

Abstract

Given some form of distance between words, a fundamental operation is to decide whether the distance between two given words w and v is within a given bound. In earlier work, we introduced the concept of a universal Levenshtein automaton for a given distance bound n. This deterministic automaton takes as input a sequence @g of bitvectors computed from w and v. The sequence @g is accepted iff the Levenshtein distance between w and v does not exceed n. The automaton is called universal since the same automaton can be used for arbitrary input words w and v, regardless of the underlying input alphabet. Here, we extend this picture. After introducing a large abstract family of generalized word distances, we exactly characterize those members where word neighborhood can be decided using universal neighborhood automata similar to universal Levenshtein automata. Our theoretical results establish several bridges to the theory of synchronized finite-state transducers and dynamic programming. For small neighborhood bounds, universal neighborhood automata can be held in main memory. This leads to very efficient algorithms for the above decision problem. Evaluation results show that these algorithms are much faster than those based on dynamic programming.