Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
inlats (0) - 21 freq inlats' (1) - 1 freq inlat (1) - 32 freq inland (2) - 5 freq ina's (2) - 1 freq inuits (2) - 2 freq nats (2) - 2 freq in-laws (2) - 2 freq infants (2) - 4 freq clats (2) - 1 freq isla's (2) - 5 freq inflate (2) - 1 freq ingate (2) - 4 freq inla (2) - 1 freq inlack (2) - 1 freq incas (2) - 1 freq innate (2) - 3 freq in'ts (2) - 2 freq inlaik (2) - 1 freq islans (2) - 5 freq inlaid (2) - 3 freq splats (2) - 3 freq lats (2) - 26 freq inate (2) - 1 freq inlaiks (2) - 1 freq |
inlats (0) - 21 freq inlats' (2) - 1 freq inlat (2) - 32 freq lats (3) - 26 freq clats (3) - 1 freq inpits (3) - 5 freq ints (3) - 1 freq inlet (3) - 1 freq in'ts (3) - 2 freq flats (3) - 20 freq inlaiks (3) - 1 freq inuits (3) - 2 freq nats (3) - 2 freq inmates (3) - 1 freq salts (4) - 1 freq bolts (4) - 12 freq neyts (4) - 5 freq pilates (4) - 1 freq bleats (4) - 1 freq bloats (4) - 1 freq umlauts (4) - 2 freq floats (4) - 13 freq palates (4) - 1 freq celts (4) - 9 freq ents (4) - 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 - INLTS inlats - 21 freq inlats' - 1 freq inaldz - 1 freq |
INLATS |
Time to execute Levenshtein function - 0.311285 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.765403 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.092270 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.036659 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.000822 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. |