| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lumber (0) - 5 freq slumber (1) - 8 freq lumbers (1) - 3 freq lumbert (1) - 7 freq humber (1) - 2 freq limber (1) - 2 freq plumber (1) - 14 freq number (1) - 172 freq lumner (1) - 1 freq umber (1) - 2 freq member (2) - 75 freq numbers (2) - 64 freq lambeg (2) - 5 freq nummer (2) - 336 freq lunder (2) - 1 freq lambed (2) - 2 freq lumberin (2) - 1 freq lumbs (2) - 1 freq lumed (2) - 1 freq bumper (2) - 3 freq jumper (2) - 43 freq sumer (2) - 1 freq comber (2) - 2 freq bumbee (2) - 4 freq uber (2) - 2 freq |
lumber (0) - 5 freq limber (1) - 2 freq plumber (2) - 14 freq umber (2) - 2 freq lumner (2) - 1 freq number (2) - 172 freq humber (2) - 2 freq slumber (2) - 8 freq lumbers (2) - 3 freq lumbert (2) - 7 freq lumpur (3) - 2 freq lammer (3) - 2 freq camber (3) - 1 freq amber (3) - 13 freq timber (3) - 4 freq bomber (3) - 3 freq comber (3) - 2 freq lumburt (3) - 1 freq lumbered (3) - 1 freq clamber (3) - 5 freq limbed (3) - 1 freq lambert (3) - 3 freq lumberin (3) - 1 freq limmer (3) - 19 freq lambeg (3) - 5 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 - LMR lammer - 2 freq limmer - 19 freq lamour - 1 freq lumber - 5 freq l'amour - 1 freq limber - 2 freq |
LUMBER |
| Time to execute Levenshtein function - 0.211158 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.357891 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.027547 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.036963 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.000866 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. |