Implementing the Levenshtein

english
deutsch

Problems with Implementing the Levensthein

The Levenshtein-Algorithm delivers a high quality String Matching. Up to now implementations of the Levenshtein-Algorithm have been too slow to use on large databases. Exorbyte GmbH achieved a quantum leap in terms of approximate matching speed through intensive R&D. With its technology the Levenshtein-Algorithm delivers Edit-Distances on a database with 2.5 million records in less than 10 milliseconds. Exorbyte's technology is used by search engines such as Yahoo!, Overture, Miva.com and T-info among others.

Code-Samples

see Levenshtein-Links
Feedback -  Imprint