search

universal-automata / liblevenshtein

Various utilities regarding Levenshtein transducers.
https://github.com/universal-automata/liblevenshtein
MIT License
67 stars 13 forks source link

"dog" is returned for word="chold", n=2, algorithm="merge_and_split" #2

Closed dylon closed 12 years ago

dylon commented 12 years ago 
Distances to Every Dictionary Term:
  distance(chold, cold) = 1
  distance(chold, cholld) = 1
  distance(chold, cat) = 2
  distance(chold, dog) = 3
  distance(chold, horse) = 3
  distance(chold, ant) = 3
  distance(chold, lizard) = 3
  distance(chold, man) = 3
  distance(chold, salamander) = 3
  distance(chold, slitehr) = 3
  distance(chold, slithre) = 3
  distance(chold, snake) = 3
  distance(chold, insect) = 3
----------------------------------------
Distances to Every Transduced Term:
  distance(chold, cold) = 1
  distance(chold, cholld) = 1
  distance(chold, cat) = 2
  distance(chold, dog) = 3
----------------------------------------
n = 2
----------------------------------------
Time to construct transducer: 2 ms
Time to transuce the dictionary: 0 ms