Mak Nazečić-Andrlon Muon
Muon
/ levenshtein.coffee
Created
February 15, 2012 17:27
Levenshtein algorithm implementation in CoffeeScript
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| levenshtein = (a, b) -> | |
| # Handle degenerate cases | |
| if a == b | |
| return 0 | |
| unless a.length > 0 and b.length > 0 | |
| return a.length or b.length | |
| # Normalize order for cache | |
| if b.length < a.length |
NewerOlder