search

universal-automata / liblevenshtein

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

Simplify the transducer so it only selects spelling candidates #7

Closed dylon closed 10 years ago

dylon commented 10 years ago
  1. Remove the options for things such as spelling-insensitive ranking
    • Those should be handled externally
    • The job of the transducer should be to find spelling candidates. Let consumers decide for themselves how to handle ranking, etc.
    • This will simplify the logic and make maintenance and testing easier.