| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pathfoot (0) - 1 freq aathoot (2) - 1 freq athoot (2) - 319 freq with-oot (3) - 1 freq athort (3) - 122 freq pathos (3) - 5 freq hotfoot (3) - 1 freq bathroom (3) - 44 freq athott (3) - 1 freq withoot (3) - 413 freq 'ithoot (3) - 1 freq ithoot (3) - 53 freq afoot (3) - 1 freq ahoot (3) - 1 freq athout (3) - 29 freq patriot (3) - 3 freq a'thoot (3) - 1 freq fathoor (3) - 1 freq barefoot (3) - 3 freq pit-oot (3) - 5 freq packfou (4) - 1 freq peacefoo (4) - 1 freq thowt (4) - 97 freq gratefoo (4) - 4 freq yawhoo (4) - 1 freq |
pathfoot (0) - 1 freq athoot (4) - 319 freq aathoot (4) - 1 freq ithoot (5) - 53 freq 'ithoot (5) - 1 freq athout (5) - 29 freq pit-oot (5) - 5 freq withoot (5) - 413 freq patriot (5) - 3 freq a'thoot (5) - 1 freq pathos (5) - 5 freq athort (5) - 122 freq hotfoot (5) - 1 freq with-oot (5) - 1 freq athott (5) - 1 freq thoat (6) - 103 freq suthfast (6) - 1 freq throt (6) - 3 freq atheist (6) - 2 freq thurot (6) - 3 freq theft (6) - 12 freq petticot (6) - 1 freq potshot (6) - 1 freq tholt (6) - 1 freq moothfoo (6) - 1 freq |
SoundEx code - P313 poot-poot-pootin - 1 freq poot-poot - 2 freq phut-phut-phut-phut-phut - 1 freq pit-poetry - 1 freq pathfoot - 1 freq pee-the-bed - 1 freq pit-pat - 2 freq pit-a-pat - 1 freq putbodypartsinfilms - 1 freq ptbt - 1 freq |
MetaPhone code - P0FT pathfoot - 1 freq |
PATHFOOT |
| Time to execute Levenshtein function - 0.398665 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.519919 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.028093 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.071523 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.000882 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. |