-- import "github.com/dvirsky/levenshtein"
type SparseAutomaton struct {
}SparseAutomaton is a naive Go implementation of a levenshtein automaton using sparse vectors, as described and implemented here: http://julesjacobs.github.io/2015/06/17/disqus-levenshtein-simple-and-fast.html
func NewSparseAutomaton(s string, maxEdits int) *SparseAutomatonNewSparseAutomaton creates a new automaton for the string s, with a given max edit distance check
func (a *SparseAutomaton) CanMatch(v sparseVector) boolCanMatch returns true if there is a possibility that feeding the automaton with more steps will yield a match. Once CanMatch is false there is no point in continuing iteration
func (a *SparseAutomaton) IsMatch(v sparseVector) boolIsMatch returns true if the current state vector represents a string that is within the max edit distance from the initial automaton string
func (a *SparseAutomaton) Start() sparseVectorStart initializes the automaton's state vector and returns it for further iteration
func (a *SparseAutomaton) Step(state sparseVector, c byte) sparseVectorStep returns the next state of the automaton given a pervios state and a character to check
func (a *SparseAutomaton) Transitions(v sparseVector) []bytetype Trie struct {
}Trie holds a trie representation of a dictionary of words, for fuzzy matching against it
func NewTrie() *TrieNewTrie creates a new empty trie
func (t *Trie) Exists(s string) boolExists returns true if a string exists as it is in the trie
func (t *Trie) FuzzyMatches(s string, maxDist int) []stringFuzzyMatches returns all the words in the trie that are with maxDist edit distance from s
func (t *Trie) Insert(s string)Insert adds a string to the trie