| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uphauders (0) - 5 freq uphauden (2) - 6 freq hauders (2) - 3 freq uphauds (2) - 8 freq uphaud (3) - 121 freq uphaudan (3) - 1 freq uphauddin (3) - 2 freq phasers (3) - 1 freq uphauddit (3) - 2 freq uphauding (3) - 1 freq prauers (3) - 1 freq behauder (3) - 2 freq uphaudit (3) - 13 freq haunders (3) - 1 freq pouders (3) - 2 freq hauners (3) - 6 freq handers (3) - 1 freq chaumers (3) - 14 freq shouders (3) - 43 freq shalders (3) - 6 freq haufers (3) - 4 freq paupers (3) - 3 freq uphaudin (3) - 42 freq chancers (4) - 3 freq haunels (4) - 1 freq |
uphauders (0) - 5 freq hauders (3) - 3 freq uphauds (3) - 8 freq phasers (4) - 1 freq pouders (4) - 2 freq uphauden (4) - 6 freq shouders (4) - 43 freq ponders (5) - 3 freq paupers (5) - 3 freq shalders (5) - 6 freq heiders (5) - 4 freq uphaudin (5) - 42 freq shooders (5) - 132 freq punders (5) - 2 freq pooders (5) - 3 freq polders (5) - 1 freq pounders (5) - 2 freq phaedra (5) - 14 freq haufers (5) - 4 freq chaumers (5) - 14 freq prauers (5) - 1 freq uphauddit (5) - 2 freq uphauddin (5) - 2 freq uphaud (5) - 121 freq uphaudan (5) - 1 freq |
SoundEx code - U136 upthrou - 1 freq upturnit - 1 freq upturned - 7 freq upturn - 1 freq upturnt - 8 freq up-a-tree-ee - 1 freq updraa - 1 freq updraft - 1 freq upthrew - 1 freq uphauders - 5 freq up-dreuch - 1 freq upatree - 1 freq |
MetaPhone code - UFTRS uphauders - 5 freq |
UPHAUDERS |
| Time to execute Levenshtein function - 0.176172 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.337585 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.027261 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.037119 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.000849 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. |