| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tedderin (0) - 1 freq gedderin (1) - 1 freq tenderin (1) - 2 freq ludderin (2) - 1 freq lewderin (2) - 1 freq tedders (2) - 1 freq rudderin (2) - 1 freq widderin (2) - 1 freq gadderin (2) - 14 freq teddert (2) - 2 freq teerin (2) - 5 freq budderin (2) - 6 freq badderin (2) - 1 freq teeterin (2) - 6 freq tedder (2) - 2 freq fedderie (2) - 1 freq renderin (2) - 5 freq didderin (2) - 1 freq dodderin (2) - 1 freq tenderlie (3) - 1 freq hudderie (3) - 7 freq tenderly (3) - 5 freq geddert (3) - 1 freq hennerin (3) - 1 freq peddlin (3) - 6 freq |
tedderin (0) - 1 freq tenderin (2) - 2 freq gedderin (2) - 1 freq budderin (3) - 6 freq badderin (3) - 1 freq didderin (3) - 1 freq teddert (3) - 2 freq tedder (3) - 2 freq gadderin (3) - 14 freq dodderin (3) - 1 freq tedders (3) - 1 freq rudderin (3) - 1 freq widderin (3) - 1 freq ludderin (3) - 1 freq tidder (4) - 50 freq suddern (4) - 1 freq toddlin (4) - 2 freq teddirt (4) - 1 freq renderin (4) - 5 freq teeterin (4) - 6 freq fedderie (4) - 1 freq teerin (4) - 5 freq lewderin (4) - 1 freq leddery (5) - 1 freq gadderie (5) - 9 freq |
SoundEx code - T365 teeterin - 6 freq totterin - 1 freq tie-dye-rainbow - 1 freq twitterin - 2 freq tittrin - 1 freq tedderin - 1 freq tetrameter - 1 freq tidyroom - 1 freq |
MetaPhone code - TTRN teeterin - 6 freq dodderin - 1 freq totterin - 1 freq doiterin - 1 freq didderin - 1 freq tittrin - 1 freq tedderin - 1 freq |
TEDDERIN |
| Time to execute Levenshtein function - 0.229056 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.477169 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.027799 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.068044 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.000936 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. |