How to do fuzzy string matching of bigger than memory dictionary in an ordered key-value store?
问题 I am looking for an algorithm and storage schema to do string matching over a bigger than memory dictionary. My initial attempt, inspired from https://swtch.com/~rsc/regexp/regexp4.html, was to store trigams of every word of the dictionary for instance the word apple is split into $ap , app , ppl , ple and le$ at index time. All of those trigram as associated with the word they came from. Then I query time, I do the same for the input string that must be matched. I look up every of those