| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ipma (0) - 1 freq ipa (1) - 1 freq imma (1) - 1 freq ima (1) - 1 freq i-a (2) - 1 freq o'ma (2) - 2 freq jpla (2) - 1 freq spm (2) - 1 freq pm- (2) - 1 freq mima (2) - 1 freq iam (2) - 2 freq puma (2) - 2 freq zbma (2) - 1 freq pmn (2) - 1 freq mpm (2) - 1 freq ifa (2) - 4 freq emma (2) - 42 freq coma (2) - 13 freq pmd (2) - 1 freq hima (2) - 4 freq tpea (2) - 1 freq imna (2) - 1 freq €™ma (2) - 4 freq jpm (2) - 1 freq iym (2) - 2 freq |
ipma (0) - 1 freq pm (2) - 125 freq ypm (2) - 2 freq apm (2) - 1 freq apmi (2) - 1 freq pima (2) - 1 freq puma (2) - 2 freq imma (2) - 1 freq ima (2) - 1 freq ipa (2) - 1 freq paa (3) - 12 freq up-a (3) - 1 freq pmt (3) - 3 freq pta (3) - 1 freq ma (3) - 15179 freq pia (3) - 3 freq apa (3) - 2 freq psa (3) - 3 freq ipn (3) - 1 freq upa (3) - 2 freq ipso (3) - 2 freq pome (3) - 6 freq mama (3) - 2 freq ipe (3) - 1 freq lima (3) - 2 freq |
SoundEx code - I150 iphone - 7 freq if'n - 1 freq iffen - 4 freq ivanhoe - 1 freq ivinoo - 1 freq ipon - 16 freq ivan - 6 freq ievin - 1 freq i'pain - 1 freq i'phone - 6 freq i'bin - 2 freq i'bun - 6 freq ivnou - 1 freq ibone - 1 freq ipma - 1 freq iybbbnue - 1 freq ipn - 1 freq |
MetaPhone code - IPM ipma - 1 freq |
IPMA |
| Time to execute Levenshtein function - 0.399019 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.977329 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.037137 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.098072 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.000873 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. |