| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thetford (0) - 1 freq letford (2) - 1 freq the-fore (2) - 1 freq montford (3) - 1 freq rutherford (3) - 4 freq theory (3) - 33 freq wexford (3) - 4 freq thetr (3) - 1 freq bedford (3) - 1 freq theworld (3) - 1 freq stratford (3) - 1 freq themorn (3) - 1 freq thewords (3) - 1 freq trafford (3) - 1 freq pletform (3) - 1 freq watford (3) - 2 freq therefore (3) - 31 freq taethurd (3) - 1 freq thord (3) - 3 freq therd (3) - 2 freq therefor (3) - 1 freq whitfor (3) - 2 freq thetwo (3) - 1 freq the-morn (3) - 2 freq bestford (3) - 1 freq |
thetford (0) - 1 freq the-fore (4) - 1 freq letford (4) - 1 freq taethurd (5) - 1 freq watford (5) - 2 freq thord (5) - 3 freq therefor (5) - 1 freq bestford (5) - 1 freq whitfor (5) - 2 freq trafford (5) - 1 freq therd (5) - 2 freq therefore (5) - 31 freq montford (5) - 1 freq rutherford (5) - 4 freq thetr (5) - 1 freq stratford (5) - 1 freq thatched (6) - 4 freq thatd (6) - 1 freq thyroid (6) - 1 freq shetfrog (6) - 1 freq that're (6) - 1 freq thatd (6) - 1 freq whitfur (6) - 2 freq that'd (6) - 29 freq thurd (6) - 15 freq |
SoundEx code - T316 toothbrush - 4 freq toothbrushes - 1 freq tattiepark - 1 freq thetford - 1 freq taethebard - 1 freq |
MetaPhone code - 0TFRT thetford - 1 freq |
THETFORD |
| Time to execute Levenshtein function - 0.200297 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.367026 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.027889 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.037642 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.000937 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. |