| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thikfauld (0) - 6 freq twa-fauld (3) - 1 freq blinfauld (3) - 4 freq twafauld (3) - 4 freq thankful (4) - 11 freq hauld (4) - 17 freq onfauld (4) - 1 freq twafald (4) - 1 freq aefauld (4) - 19 freq ninefauld (4) - 1 freq unfauld (4) - 1 freq twafaald (4) - 2 freq twa-faul (4) - 1 freq stanefauld (4) - 2 freq fauld (4) - 37 freq tauld (4) - 11 freq thim-aal (4) - 1 freq blinfaul (4) - 1 freq thirablo (4) - 1 freq blinfaulds (4) - 2 freq skauld (4) - 1 freq painful (5) - 18 freq tearful (5) - 2 freq shiftied (5) - 1 freq whitefaced (5) - 1 freq |
thikfauld (0) - 6 freq twafauld (5) - 4 freq twa-fauld (5) - 1 freq twafald (6) - 1 freq twafaald (6) - 2 freq thankful (6) - 11 freq blinfauld (6) - 4 freq two-fold (7) - 1 freq whitefield (7) - 2 freq tankfully (7) - 2 freq thenkfully (7) - 1 freq thunkfully (7) - 1 freq thistled (7) - 1 freq hadfield (7) - 4 freq thankfully (7) - 28 freq shawfield (7) - 1 freq trifled (7) - 1 freq hayfield (7) - 3 freq twofold (7) - 1 freq heyfield (7) - 3 freq theworld (7) - 1 freq sheffield (7) - 3 freq skauld (7) - 1 freq unfauld (7) - 1 freq twa-faul (7) - 1 freq |
SoundEx code - T214 touchie-feely - 1 freq tascabili - 1 freq tax-plan - 1 freq thikfauld - 6 freq thesavoylondon - 1 freq |
MetaPhone code - 0KFLT thikfauld - 6 freq |
THIKFAULD |
| Time to execute Levenshtein function - 0.198660 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.423809 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.030730 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.038128 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.000934 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. |