Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ip (0) - 15 freq i'p (1) - 2 freq dip (1) - 22 freq iy (1) - 3 freq ipo (1) - 56 freq mp (1) - 39 freq sp (1) - 8 freq wip (1) - 3 freq ap (1) - 94 freq im (1) - 370 freq irp (1) - 2 freq il (1) - 39 freq ips (1) - 2 freq vp (1) - 4 freq if (1) - 5948 freq aip (1) - 10 freq lip (1) - 86 freq iw (1) - 2 freq hip (1) - 34 freq qp (1) - 7 freq i (1) - 18870 freq jip (1) - 4 freq pip (1) - 7 freq ik (1) - 8 freq i- (1) - 1 freq |
ip (0) - 15 freq iep (1) - 1 freq yp (1) - 4 freq up (1) - 13212 freq p (1) - 333 freq ipe (1) - 1 freq op (1) - 7 freq ipa (1) - 1 freq yip (1) - 3 freq aip (1) - 10 freq ipo (1) - 56 freq ap (1) - 94 freq ep (1) - 10 freq imp (2) - 3 freq iz (2) - 434 freq ipn (2) - 1 freq in (2) - 45098 freq vip (2) - 1 freq jp (2) - 7 freq rip (2) - 57 freq ih (2) - 81 freq cp (2) - 4 freq iv (2) - 149 freq ij (2) - 2 freq tp (2) - 5 freq |
SoundEx code - I100 if - 5948 freq i've - 623 freq 'if - 98 freq iv - 149 freq ifa - 4 freq ive - 11 freq ivy - 8 freq 'i've - 33 freq ip - 15 freq ifi - 1 freq ipa - 1 freq i'v - 7 freq ifhe - 1 freq if'he - 1 freq ivve - 1 freq ifye - 1 freq '-if - 1 freq i-if - 1 freq 'iv - 1 freq ipo - 56 freq i'huff - 1 freq i'wife - 2 freq i'wifie - 1 freq i'p - 2 freq €˜if - 9 freq €œif - 39 freq iva - 1 freq €”if - 2 freq €™if - 2 freq iÂ’ve - 70 freq ifhiha - 1 freq iep - 1 freq ibv - 2 freq iv'aa - 1 freq ibo - 1 freq iabi - 1 freq iuoeahf - 1 freq iffa - 1 freq ifo - 1 freq ivv - 1 freq i'vé - 1 freq ievfua - 1 freq iof - 1 freq iybv - 2 freq ifbw - 1 freq ib - 1 freq ipe - 1 freq iffy - 1 freq ibu - 1 freq |
MetaPhone code - IP ip - 15 freq ipa - 1 freq ipo - 56 freq i'p - 2 freq iep - 1 freq ipe - 1 freq |
IP |
Time to execute Levenshtein function - 0.197629 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.320276 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.027787 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.037773 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.000925 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. |