| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lowderin (0) - 1 freq lewderin (1) - 1 freq lowerin (1) - 11 freq howderin (1) - 3 freq sowderin (1) - 1 freq powderin (1) - 1 freq lowrin (2) - 2 freq lowering (2) - 2 freq cowerin (2) - 5 freq looderit (2) - 1 freq lowdin (2) - 1 freq glowerin (2) - 61 freq lowerit (2) - 1 freq towerin (2) - 12 freq ludderin (2) - 1 freq lounderin (2) - 3 freq loiterin (2) - 3 freq powerin (2) - 3 freq borderin (2) - 2 freq lowden (2) - 12 freq ponderin (2) - 3 freq lounerin (2) - 1 freq lowein (2) - 1 freq dodderin (2) - 1 freq wonderin (2) - 51 freq |
lowderin (0) - 1 freq lewderin (1) - 1 freq powderin (2) - 1 freq sowderin (2) - 1 freq howderin (2) - 3 freq lowerin (2) - 11 freq ludderin (3) - 1 freq lowden (3) - 12 freq lounderin (3) - 3 freq lowdin (3) - 1 freq lowrin (3) - 2 freq forderin (4) - 191 freq wonderin (4) - 51 freq plowterin (4) - 10 freq dodderin (4) - 1 freq launderin (4) - 2 freq lowdoun (4) - 1 freq smowderin (4) - 1 freq orderin (4) - 10 freq bawdrin (4) - 2 freq lowein (4) - 1 freq gowerin (4) - 1 freq glowerin (4) - 61 freq lounerin (4) - 1 freq cowerin (4) - 5 freq |
SoundEx code - L365 lettern - 1 freq leatherin - 6 freq leathern - 3 freq lowderin - 1 freq laithern - 1 freq letterman - 1 freq letterin - 6 freq ludderin - 1 freq ladrons - 1 freq litterin - 1 freq lewderin - 1 freq lutheran - 1 freq loiterin - 3 freq lettering - 2 freq latharna - 6 freq latrines - 3 freq lettermore - 1 freq lotternine - 1 freq littering - 1 freq latraynor - 1 freq leatherman - 1 freq |
MetaPhone code - LTRN lettern - 1 freq lowderin - 1 freq letterin - 6 freq ludderin - 1 freq litterin - 1 freq lewderin - 1 freq loiterin - 3 freq |
LOWDERIN |
| Time to execute Levenshtein function - 0.223944 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.399692 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.028438 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.040108 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.001024 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. |