Asdrúbal Iván Suárez Rivera asdrubalivan
asdrubalivan
/ levenshtein.coffee
Created
June 7, 2014 16:38
Levenshtein distance algorithm 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
| ### | |
| # @desc: Recursive Implementation of Levenshtein distance algorithm | |
| # according to Wikipedia's pseudocode implementation of it | |
| # @author: Asdrúbal Suárez (Twitter @asdrubalivan) | |
| ### | |
| levenshteinInternal = (s, len_s, t, len_t) -> | |
| if len_s is 0 | |
| return len_t | |
| if len_t is 0 | |
| return len_s |
NewerOlder