| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iggerant (0) - 1 freq ignorant (2) - 37 freq iggerance (2) - 2 freq interact (3) - 9 freq ggeanh (3) - 1 freq vagrant (3) - 1 freq imporant (3) - 1 freq pageant (3) - 2 freq ignurnt (3) - 1 freq laggeran (3) - 3 freq emerant (3) - 9 freq grant (3) - 101 freq degerent (3) - 1 freq tolerant (3) - 1 freq inherent (3) - 7 freq eerant (3) - 2 freq kiggerin (3) - 1 freq ignoran (3) - 2 freq bigger'n (3) - 1 freq migrant (3) - 6 freq reverant (3) - 3 freq biggent (3) - 1 freq itinerant (3) - 1 freq emergant (4) - 1 freq courrant (4) - 1 freq |
iggerant (0) - 1 freq iggerance (3) - 2 freq ignorant (3) - 37 freq grant (4) - 101 freq migrant (4) - 6 freq ignurnt (4) - 1 freq degerent (4) - 1 freq vagrant (4) - 1 freq graunt (5) - 1 freq vaagrant (5) - 1 freq graint (5) - 4 freq gurnt (5) - 1 freq granet (5) - 1 freq girnt (5) - 4 freq juggernaut (5) - 3 freq granut (5) - 1 freq groant (5) - 2 freq granit (5) - 2 freq gubernt (5) - 1 freq emigrant (5) - 2 freq eegnorant (5) - 1 freq maigrant (5) - 1 freq gpirnt (5) - 1 freq greent (5) - 1 freq grunt (5) - 33 freq |
SoundEx code - I265 i'groond - 4 freq i'carnies - 2 freq i'corner - 1 freq iggerance - 2 freq iggerant - 1 freq ice-rink - 1 freq igyrnfn - 1 freq iscreamdice - 1 freq |
MetaPhone code - IKRNT i'groond - 4 freq iggerant - 1 freq |
IGGERANT |
| Time to execute Levenshtein function - 0.246815 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.448911 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.030376 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.039641 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.000948 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. |