| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| updatit (0) - 13 freq updaetit (1) - 2 freq updatin (1) - 4 freq datit (2) - 6 freq update (2) - 16 freq undantit (2) - 1 freq updates (2) - 9 freq apdatin (2) - 2 freq updating (2) - 2 freq daetit (3) - 1 freq heatit (3) - 2 freq pyntit (3) - 98 freq coatit (3) - 5 freq dartit (3) - 2 freq poakit (3) - 26 freq ootdatit (3) - 1 freq unwantit (3) - 2 freq placit (3) - 1 freq partit (3) - 4 freq ratit (3) - 1 freq peakit (3) - 1 freq spratt (3) - 2 freq postit (3) - 13 freq bleatit (3) - 2 freq repeatit (3) - 52 freq |
updatit (0) - 13 freq updaetit (1) - 2 freq updatin (2) - 4 freq apdatin (3) - 2 freq updates (3) - 9 freq update (3) - 16 freq datit (3) - 6 freq eppatite (4) - 1 freq pintit (4) - 14 freq endytit (4) - 1 freq pertit (4) - 2 freq poutit (4) - 1 freq pantit (4) - 2 freq dotit (4) - 1 freq dautit (4) - 1 freq pentit (4) - 44 freq pattit (4) - 20 freq powtit (4) - 2 freq pittit (4) - 2 freq pottit (4) - 3 freq pactit (4) - 3 freq puttit (4) - 1 freq optit (4) - 1 freq peltit (4) - 5 freq petit (4) - 1 freq |
SoundEx code - U133 updatin - 4 freq updates - 9 freq updatit - 13 freq uphauddit - 2 freq updaetit - 2 freq update - 16 freq updating - 2 freq up-ti-date - 2 freq up-tae-date - 1 freq uphaudit - 13 freq up-hauddit - 1 freq up-to-date - 1 freq up-haudit - 1 freq up-tae-the-meinit - 1 freq up-tae-the-meenit - 1 freq upthedons - 2 freq updates' - 1 freq |
MetaPhone code - UPTTT updatit - 13 freq updaetit - 2 freq up-ti-date - 2 freq up-tae-date - 1 freq up-to-date - 1 freq |
UPDATIT |
| Time to execute Levenshtein function - 0.225216 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.352698 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.027691 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.037193 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.000927 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. |