| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inlat (0) - 32 freq inlet (1) - 1 freq inlats (1) - 21 freq inlan (1) - 1 freq inla (1) - 1 freq islan (2) - 13 freq ineae (2) - 1 freq ina (2) - 99 freq lat (2) - 551 freq 'lat (2) - 14 freq inqa (2) - 1 freq in't (2) - 42 freq ingan (2) - 11 freq inlaik (2) - 1 freq incam (2) - 3 freq inlack (2) - 1 freq inflate (2) - 1 freq inpit (2) - 49 freq input (2) - 4 freq intae (2) - 4586 freq lclat (2) - 1 freq neat (2) - 42 freq int (2) - 31 freq €œlat (2) - 13 freq inklan (2) - 1 freq |
inlat (0) - 32 freq inlet (1) - 1 freq inlan (2) - 1 freq inla (2) - 1 freq inlats (2) - 21 freq inact (3) - 1 freq innit (3) - 10 freq ungat (3) - 1 freq ingate (3) - 4 freq inert (3) - 3 freq ingait (3) - 8 freq flat (3) - 263 freq init (3) - 1 freq intit (3) - 11 freq intaa (3) - 1 freq blat (3) - 37 freq innate (3) - 3 freq inlaid (3) - 3 freq inapt (3) - 1 freq nat (3) - 21 freq inate (3) - 1 freq infit (3) - 1 freq inept (3) - 1 freq anat (3) - 1 freq intay (3) - 3 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 |
INLAT |
| Time to execute Levenshtein function - 0.283478 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.534161 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.067047 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.037562 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.000790 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. |