Implement fast Levenshtein distance algorithm in Delphi by jv16

Your job is to write in Delphi a fast, case insensitive implementation of the Levenshtein distance algorithm. For example, you can use this implementation: http://www.codeproject.com/Articles/13525/Fast-memory-efficient-Levenshtein-algorithm… (Budget: $30-$250 USD, Jobs: Algorithm, Delphi)


Leave a Reply

Your email address will not be published. Required fields are marked *