| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lambretta (0) - 1 freq lambert (3) - 3 freq lazaretto (3) - 1 freq larbert (4) - 2 freq jimbett (4) - 1 freq hammett (4) - 1 freq brettan (4) - 1 freq umbrella (4) - 12 freq lambeg (4) - 5 freq lambeens (4) - 2 freq larrea (4) - 1 freq lumbert (4) - 7 freq ambedka (4) - 8 freq biretta (4) - 1 freq laments (4) - 9 freq sarepta (4) - 1 freq maladetta (4) - 1 freq moretti (4) - 1 freq lambed (4) - 2 freq lamb-stew (4) - 1 freq barrett (4) - 1 freq lambie (4) - 3 freq clampetts (4) - 1 freq aretha (4) - 1 freq lambies (4) - 4 freq |
lambretta (0) - 1 freq lambert (4) - 3 freq lumbert (5) - 7 freq lazaretto (5) - 1 freq moretti (6) - 1 freq lamb-pot (6) - 1 freq lambrusco (6) - 2 freq clambert (6) - 2 freq lumburt (6) - 1 freq larbert (6) - 2 freq lambast (6) - 1 freq biretta (6) - 1 freq jimbett (6) - 1 freq alberta (6) - 1 freq majorette (6) - 2 freq deanbrett (6) - 7 freq lombarda (7) - 1 freq laceratit (7) - 1 freq lamentit (7) - 1 freq claimbert (7) - 1 freq launderette (7) - 1 freq alberto (7) - 2 freq umberto (7) - 1 freq lumber (7) - 5 freq albertz (7) - 4 freq |
SoundEx code - L516 lambert - 3 freq lumbers - 3 freq lumber - 5 freq lumper's - 1 freq lan-afore - 1 freq lumberin - 1 freq lambrusco - 2 freq lumbert - 7 freq lumbered - 1 freq laun-brist - 1 freq llanbryde - 1 freq lumberjack - 1 freq lion-freens - 1 freq lumpur - 2 freq limber - 2 freq lamborghini - 10 freq lamborghinis - 1 freq lumburt - 1 freq lombarda - 1 freq lambretta - 1 freq limpar - 1 freq |
MetaPhone code - LMRT lambert - 3 freq lumbert - 7 freq lumbered - 1 freq lumburt - 1 freq lombarda - 1 freq lambretta - 1 freq |
LAMBRETTA |
| Time to execute Levenshtein function - 0.210543 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.418638 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.032692 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.061635 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000800 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |