| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thepantryman (0) - 1 freq theatrical (5) - 6 freq handyman (5) - 2 freq thescotsman (5) - 8 freq pheasantry (6) - 1 freq panorama (6) - 1 freq dairyman (6) - 2 freq thecalybar (6) - 1 freq harman (6) - 1 freq fancyman (6) - 1 freq henman (6) - 1 freq hang-man (6) - 1 freq henchman (6) - 1 freq thecatstrand (6) - 1 freq thenational (6) - 5 freq tantrum (6) - 1 freq themarra (6) - 1 freq sherman (6) - 1 freq thanthay (6) - 1 freq pantry (6) - 7 freq gentleman (6) - 25 freq theferryinn (6) - 1 freq trapalyan (6) - 1 freq thankryfe (6) - 2 freq hearan (6) - 14 freq |
thepantryman (0) - 1 freq thescotsman (8) - 8 freq huntsman (9) - 2 freq the-streen (9) - 1 freq tantrums (9) - 2 freq tantrum (9) - 1 freq thingman (9) - 2 freq handyman (9) - 2 freq theringroon (9) - 1 freq countrymen (9) - 1 freq theatrical (9) - 6 freq henryson (10) - 14 freq twenty-wan (10) - 5 freq pantan (10) - 3 freq theatre's (10) - 1 freq theatres (10) - 5 freq the-intae (10) - 2 freq dothebartman (10) - 1 freq thratchan (10) - 1 freq twintywan (10) - 1 freq hatman (10) - 1 freq thanketron (10) - 1 freq thermal (10) - 12 freq hielandman (10) - 1 freq tinkerman (10) - 1 freq |
SoundEx code - T153 two-pound - 1 freq thepantryman - 1 freq tvandfilmstars - 1 freq |
MetaPhone code - 0PNTRMN thepantryman - 1 freq |
THEPANTRYMAN |
| Time to execute Levenshtein function - 0.296514 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.506045 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.030457 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.045687 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.001265 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. |