Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
updates (0) - 9 freq update (1) - 16 freq updates' (1) - 1 freq dates (2) - 36 freq plates (2) - 58 freq spates (2) - 2 freq updatin (2) - 4 freq updatit (2) - 13 freq paces (3) - 14 freq speakes (3) - 1 freq skates (3) - 6 freq danes (3) - 2 freq date (3) - 160 freq rates (3) - 18 freq uplands (3) - 2 freq spaces (3) - 19 freq upwarts (3) - 2 freq inmates (3) - 1 freq upatree (3) - 1 freq datfs (3) - 1 freq sprites (3) - 2 freq sates (3) - 9 freq phases (3) - 3 freq dales (3) - 6 freq splats (3) - 3 freq |
updates (0) - 9 freq update (2) - 16 freq updates' (2) - 1 freq updatit (3) - 13 freq updatin (3) - 4 freq plates (3) - 58 freq dates (3) - 36 freq prataes (4) - 1 freq updaetit (4) - 2 freq apdatin (4) - 2 freq palates (4) - 1 freq pilates (4) - 1 freq mediates (4) - 1 freq pirates (4) - 7 freq dotes (4) - 1 freq pats (4) - 14 freq dytes (4) - 1 freq pastes (4) - 1 freq operates (4) - 4 freq poats (4) - 2 freq peats (4) - 49 freq photes (4) - 1 freq radiates (4) - 3 freq upsets (4) - 2 freq spates (4) - 2 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 - UPTTS updates - 9 freq updates' - 1 freq |
UPDATES |
Time to execute Levenshtein function - 0.204336 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.375985 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.027292 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.037427 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.000836 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. |