| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irritated (0) - 3 freq irritate (1) - 1 freq irritatin (2) - 3 freq imitated (2) - 2 freq irrate (3) - 1 freq imitate (3) - 4 freq agitated (3) - 6 freq gritted (3) - 3 freq imitatet (3) - 1 freq irritation (3) - 4 freq irrigatit (3) - 1 freq garritted (3) - 1 freq irritable (3) - 2 freq indicated (3) - 4 freq hesitated (3) - 11 freq throated (4) - 1 freq written (4) - 283 freq estimated (4) - 1 freq treated (4) - 44 freq yritten (4) - 1 freq trotted (4) - 6 freq rotates (4) - 2 freq nominated (4) - 2 freq curated (4) - 1 freq originated (4) - 2 freq |
irritated (0) - 3 freq irritate (2) - 1 freq irritatin (3) - 3 freq garritted (4) - 1 freq imitated (4) - 2 freq gritted (4) - 3 freq irritation (4) - 4 freq trotted (5) - 6 freq orientated (5) - 1 freq rutted (5) - 1 freq rotted (5) - 1 freq fretted (5) - 1 freq hesitated (5) - 11 freq arrested (5) - 15 freq garrotted (5) - 1 freq irritable (5) - 2 freq agitated (5) - 6 freq irrigatit (5) - 1 freq irrate (5) - 1 freq rütted (6) - 1 freq cremated (6) - 1 freq corrugated (6) - 3 freq fitted (6) - 27 freq dritten (6) - 1 freq radiated (6) - 1 freq |
SoundEx code - I633 irritatin - 3 freq irritation - 4 freq irritate - 1 freq irritated - 3 freq |
MetaPhone code - IRTTT irritated - 3 freq |
IRRITATED |
| Time to execute Levenshtein function - 0.497351 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.698563 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.028423 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.073535 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.001086 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. |