Word completion
fortierq opened this issue · comments
Hello,
Let's say I have a string s of size n and a dictionary D.
Is it possible to find the word in D whose prefix of size n is closest to s? That is to say, complete s in a word of D.
n may vary and I don't want to create a new SymSpell dictionary for each possible n.