Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
inlet (0) - 1 freq inlat (1) - 32 freq inset (1) - 2 freq kinset (2) - 1 freq €˜let (2) - 10 freq inten (2) - 2 freq incel (2) - 1 freq ingles (2) - 1 freq valet (2) - 1 freq ilev (2) - 1 freq inge (2) - 1 freq init (2) - 1 freq isley (2) - 1 freq inter (2) - 2 freq int (2) - 31 freq input (2) - 4 freq index (2) - 17 freq gimlet (2) - 1 freq nle (2) - 1 freq isle (2) - 85 freq plet (2) - 4 freq minglet (2) - 1 freq innit (2) - 10 freq dinnet (2) - 1 freq hintet (2) - 1 freq |
inlet (0) - 1 freq inlat (1) - 32 freq inset (2) - 2 freq 'let (3) - 15 freq bilet (3) - 3 freq endet (3) - 42 freq inept (3) - 1 freq inert (3) - 3 freq net (3) - 87 freq inact (3) - 1 freq sinlit (3) - 1 freq intit (3) - 11 freq pilet (3) - 1 freq violet (3) - 316 freq inyect (3) - 1 freq anet (3) - 1 freq flet (3) - 30 freq in't (3) - 42 freq inpit (3) - 49 freq inla (3) - 1 freq ainle (3) - 2 freq inte (3) - 129 freq pielet (3) - 2 freq onley (3) - 18 freq intee (3) - 1 freq |
SoundEx code - I543 inhaled - 3 freq inleid - 1 freq 'inleit' - 1 freq inlaid - 3 freq inlat - 32 freq inlats - 21 freq inlats' - 1 freq inhalation - 2 freq inlet - 1 freq inleitin - 2 freq inaldz - 1 freq innealadair - 5 freq |
MetaPhone code - INLT inleid - 1 freq 'inleit' - 1 freq inlaid - 3 freq inlat - 32 freq inlet - 1 freq |
INLET |
Time to execute Levenshtein function - 0.261213 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.442558 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.030685 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.038548 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.000876 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. |