gocleo

I did something similar to what you are looking for with my gocleo implementation. I create what I term the Jaccard(sp?) rating, which is the percent something is off by. github.com/jamra/gocleo You can combine that with a thing like my LevenshteinTrie github.com/jamra/LevenshteinTrie (or if you can create a DAWG, it will be more compresssed)

I wrote something comparable. It's at github.com/jamra/gocleo. It is based on a Java implementation. Would you care to link to what you wrote?

I am a chemical engineer so reading "deterministic acyclic minimized finite state automaton" is sending me back in my first years at university. As I want to implement instant search with part of string matching, this can be very interesting. This is to match "Octane, 2,4,6-trimethyl-" when typing "trimethyl". For the moment I am looking at the Linkedin approach[0]. Sorry for keeping this semi-offtopic thread alive, but these problems are so interesting that I cannot stop. [0]: https://github.com/jamra/gocleo

Here is a cool approach to the subject by Linked In. http://engineering.linkedin.com/open-source/cleo-open-source... Here is my HN-obligatory, self-written golang version: https://github.com/jamra/gocleo I went with this author's approach to use Jaccard to rank the results, however, I like this approach better: https://neil.fraser.name/writing/patch/ They basically take the distance to the beginning of the text into account.