Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
sassyalex
on Aug 10, 2014
|
parent
|
context
|
favorite
| on:
Fast and easy Levenshtein distance using a trie (2...
Here is a smart implementation of the Levenshtein algorithm:
https://github.com/jefarmstrong/sortzzy
I use in a "common pattern matching" for http routes and it works pretty well.
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
I use in a "common pattern matching" for http routes and it works pretty well.