| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| imid (0) - 1 freq ibid (1) - 2 freq timid (1) - 16 freq imed (1) - 1 freq amid (1) - 9 freq iid (1) - 1 freq mid (1) - 60 freq 'mid (1) - 1 freq iiid (1) - 1 freq rid (2) - 313 freq icin (2) - 10 freq 'rid (2) - 2 freq beid (2) - 3 freq izi (2) - 2 freq nimed (2) - 1 freq elid (2) - 2 freq iain (2) - 49 freq iio (2) - 1 freq kid (2) - 104 freq imho (2) - 4 freq mild (2) - 40 freq icic (2) - 1 freq mid- (2) - 7 freq blid (2) - 9 freq id'd (2) - 1 freq |
imid (0) - 1 freq amid (1) - 9 freq imed (1) - 1 freq mid (1) - 60 freq med (2) - 184 freq ymd (2) - 2 freq meid (2) - 4 freq mud (2) - 35 freq maid (2) - 94 freq amd (2) - 2 freq mod (2) - 10 freq aimed (2) - 16 freq muid (2) - 7 freq 'mid (2) - 1 freq iid (2) - 1 freq timid (2) - 16 freq ibid (2) - 2 freq iiid (2) - 1 freq midi (2) - 1 freq mad (2) - 356 freq md (2) - 10 freq maide (3) - 46 freq mood (3) - 82 freq mis (3) - 3 freq i'd (3) - 422 freq |
SoundEx code - I530 intae - 4690 freq into - 198 freq int - 31 freq in-the-wey - 1 freq in't - 42 freq inti - 218 freq 'intae - 2 freq inty - 21 freq inte - 129 freq intee - 1 freq inthe - 2 freq inta - 110 freq inate - 1 freq in'tae - 2 freq india' - 1 freq india - 21 freq init - 1 freq indyah - 1 freq intue - 1 freq innit - 10 freq intay - 3 freq inda - 1 freq inwith - 11 freq i'end - 2 freq ineed - 1 freq i'windae - 2 freq i'moothie - 1 freq inde - 4 freq indie - 1 freq inouth - 1 freq imid - 1 freq inhad - 1 freq inwutt - 1 freq €˜into - 1 freq intaa - 1 freq indy - 57 freq innate - 3 freq intaea - 1 freq €˜intae - 1 freq €œintae - 1 freq intiae - 1 freq ianthe - 2 freq i'nt - 1 freq inooth - 1 freq inite - 6 freq indy' - 1 freq imed - 1 freq iand - 1 freq innnit - 1 freq |
MetaPhone code - IMT imid - 1 freq imbued - 1 freq imed - 1 freq |
IMID |
| Time to execute Levenshtein function - 0.194837 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.339191 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.029114 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.038044 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.000934 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. |