| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tfphtgkh (0) - 1 freq thigh (4) - 17 freq tichtit (5) - 1 freq spetk (5) - 1 freq typing (5) - 4 freq feugh (5) - 1 freq thngs (5) - 1 freq titch (5) - 5 freq treuth (5) - 6 freq ihttkp (5) - 1 freq tiptae (5) - 6 freq uptakk (5) - 5 freq tfmmuh (5) - 1 freq pitch (5) - 89 freq thenk (5) - 23 freq tightly (5) - 5 freq trowth (5) - 26 freq feht (5) - 1 freq tooth (5) - 23 freq fwtk (5) - 1 freq ttkq (5) - 1 freq thight (5) - 2 freq uffhkky (5) - 1 freq cwchgfh (5) - 1 freq tochts (5) - 6 freq |
tfphtgkh (0) - 1 freq thigh (8) - 17 freq thochtish (9) - 3 freq throygh (9) - 1 freq olsphigh (9) - 1 freq though (9) - 1213 freq qphthe (9) - 1 freq tryptych (9) - 1 freq that'ah (9) - 1 freq typetalk (9) - 1 freq thitk (9) - 1 freq thatch (9) - 5 freq through (9) - 1547 freq that-ah (9) - 1 freq wipkh (10) - 1 freq path (10) - 178 freq thnk (10) - 8 freq thouch (10) - 12 freq hkh (10) - 1 freq truth (10) - 294 freq thenks (10) - 42 freq footch (10) - 1 freq taptaes (10) - 1 freq thresh (10) - 3 freq high (10) - 619 freq |
SoundEx code - T132 tippy-toes - 1 freq tiptoes - 3 freq tippytaes - 1 freq tiptaes - 3 freq tufty's - 3 freq tuftie's - 1 freq tuffty's - 1 freq teeveeheid's - 1 freq taypots - 1 freq theft's - 1 freq tufts - 2 freq teapots - 2 freq tippets - 1 freq tap-hats - 1 freq taptaes - 1 freq thyftis - 1 freq tip-toes - 1 freq tyfbdoqs - 1 freq tfphtgkh - 1 freq tbitg - 1 freq thebeatcroft - 1 freq tvwatzex - 1 freq |
MetaPhone code - TFFTKK tfphtgkh - 1 freq |
TFPHTGKH |
| Time to execute Levenshtein function - 0.243796 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.380098 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.028463 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.038600 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.000972 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. |