| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irritation (0) - 4 freq irrigation (1) - 1 freq irritatin (1) - 3 freq imitation (2) - 4 freq invitation (2) - 27 freq citation (3) - 2 freq imitations (3) - 3 freq irritated (3) - 3 freq variation (3) - 18 freq irritate (3) - 1 freq irrigatit (3) - 1 freq invitatioun (3) - 1 freq i'station (3) - 2 freq invitations (3) - 4 freq rotation (3) - 1 freq arbitration (3) - 4 freq agitation (3) - 5 freq limitation (3) - 1 freq gravitation (3) - 1 freq invitaetion (3) - 2 freq initiation (3) - 2 freq imitatin (3) - 3 freq habitation (3) - 6 freq hesitation (3) - 12 freq derivation (3) - 2 freq |
irritation (0) - 4 freq irritatin (1) - 3 freq irrigation (2) - 1 freq recitation (4) - 2 freq irritate (4) - 1 freq irritated (4) - 3 freq rotation (4) - 1 freq imitation (4) - 4 freq invitation (4) - 27 freq grittin (5) - 3 freq sanitation (5) - 4 freq derivation (5) - 2 freq hesitation (5) - 12 freq visitation (5) - 1 freq orientation (5) - 1 freq reputation (5) - 30 freq partition (5) - 4 freq greittin (5) - 2 freq habitation (5) - 6 freq refutation (5) - 1 freq repitition (5) - 1 freq meditation (5) - 12 freq imitatin (5) - 3 freq arbitration (5) - 4 freq invitatioun (5) - 1 freq |
SoundEx code - I633 irritatin - 3 freq irritation - 4 freq irritate - 1 freq irritated - 3 freq |
MetaPhone code - IRTXN irritation - 4 freq |
IRRITATION |
| Time to execute Levenshtein function - 0.207709 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.399113 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.028837 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.038387 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.000924 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. |