| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irritatin (0) - 3 freq irritation (1) - 4 freq irritate (2) - 1 freq irrigation (2) - 1 freq imitatin (2) - 3 freq irrigatit (2) - 1 freq irritated (2) - 3 freq britain (3) - 108 freq irritable (3) - 2 freq urinatin (3) - 1 freq hesitatin (3) - 4 freq inpittin (3) - 1 freq firritin (3) - 1 freq indicatin (3) - 8 freq imitation (3) - 4 freq scrittin (3) - 1 freq grittin (3) - 3 freq meditatin (3) - 4 freq sprittin (3) - 1 freq agitatin (3) - 2 freq eemitatin (3) - 1 freq greittin (3) - 2 freq invitation (3) - 27 freq wirritin (3) - 1 freq invitin (4) - 16 freq |
irritatin (0) - 3 freq irritation (1) - 4 freq irrigation (3) - 1 freq irritated (3) - 3 freq irritate (3) - 1 freq irrigatit (4) - 1 freq imitatin (4) - 3 freq greittin (4) - 2 freq grittin (4) - 3 freq arrestin (5) - 2 freq vritten (5) - 3 freq wirritin (5) - 1 freq rotation (5) - 1 freq rottin (5) - 10 freq written (5) - 283 freq frettin (5) - 2 freq recitation (5) - 2 freq invitation (5) - 27 freq ruttin (5) - 1 freq trottin (5) - 11 freq yritten (5) - 1 freq rittan (5) - 2 freq agitatin (5) - 2 freq inpittin (5) - 1 freq eemitatin (5) - 1 freq |
SoundEx code - I633 irritatin - 3 freq irritation - 4 freq irritate - 1 freq irritated - 3 freq |
MetaPhone code - IRTTN irritatin - 3 freq |
IRRITATIN |
| Time to execute Levenshtein function - 0.216416 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.382048 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.028554 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.039810 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.001100 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. |