| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lumbert (0) - 7 freq lumber (1) - 5 freq lumbers (1) - 3 freq lumburt (1) - 1 freq lambert (1) - 3 freq umber (2) - 2 freq lumbered (2) - 1 freq umberto (2) - 1 freq rubbert (2) - 2 freq numbers (2) - 65 freq blubbert (2) - 1 freq umbers (2) - 1 freq limber (2) - 2 freq hubbert (2) - 1 freq libert (2) - 1 freq clambert (2) - 2 freq humber (2) - 2 freq nummert (2) - 4 freq jumbelt (2) - 1 freq lundert (2) - 1 freq plumbers (2) - 6 freq larbert (2) - 2 freq lumberin (2) - 1 freq lumner (2) - 1 freq membert (2) - 3 freq |
lumbert (0) - 7 freq lumburt (1) - 1 freq lambert (1) - 3 freq lumber (2) - 5 freq lumbers (2) - 3 freq limber (3) - 2 freq clambert (3) - 2 freq membert (3) - 3 freq libert (3) - 1 freq umberto (3) - 1 freq lumberin (3) - 1 freq lumbered (3) - 1 freq larbert (3) - 2 freq plumber (4) - 14 freq number (4) - 174 freq slumber (4) - 8 freq liberty (4) - 32 freq clamberit (4) - 1 freq leiberat (4) - 1 freq lambast (4) - 1 freq claimbert (4) - 1 freq leeberty (4) - 4 freq albert (4) - 25 freq lumner (4) - 1 freq umber (4) - 2 freq |
SoundEx code - L516 lambert - 3 freq lumbers - 3 freq lumber - 5 freq lumper's - 1 freq linford - 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 |
LUMBERT |
| Time to execute Levenshtein function - 0.417876 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.788409 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.094996 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.118405 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.000919 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. |