| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inmaname (0) - 1 freq i'mannie (3) - 6 freq incarnate (3) - 1 freq insane (3) - 8 freq manage (3) - 184 freq innate (3) - 3 freq aname (3) - 1 freq inane (3) - 2 freq izanami (3) - 1 freq unmanaged (3) - 1 freq madame (3) - 32 freq mankie (4) - 6 freq manne (4) - 1 freq nane (4) - 547 freq dismantle (4) - 1 freq intae (4) - 4690 freq annandale (4) - 2 freq dinnae (4) - 1942 freq nayme (4) - 2 freq amabam (4) - 2 freq injine (4) - 7 freq i'man (4) - 1 freq hinnae (4) - 50 freq imagine (4) - 241 freq isnae (4) - 558 freq |
inmaname (0) - 1 freq nominate (5) - 1 freq madame (5) - 32 freq innmo (5) - 1 freq unmeanan (5) - 1 freq innimy (5) - 1 freq izanami (5) - 1 freq unmanaged (5) - 1 freq insane (5) - 8 freq inane (5) - 2 freq manage (5) - 184 freq aname (5) - 1 freq i'mannie (5) - 6 freq innate (5) - 3 freq canmnae (6) - 1 freq manse (6) - 19 freq inginan (6) - 1 freq enhance (6) - 15 freq unnamed (6) - 4 freq somane (6) - 1 freq infant (6) - 20 freq insanity (6) - 4 freq infinite (6) - 9 freq indiana (6) - 2 freq infamy (6) - 5 freq |
SoundEx code - I555 inhumane - 2 freq imminent - 4 freq inmaname - 1 freq inhumanity - 1 freq iniment - 1 freq inanundir - 4 freq inanimate - 2 freq in-anunder - 1 freq inanimitie - 1 freq imminently - 1 freq inhuman - 2 freq inamong - 1 freq iminent - 1 freq |
MetaPhone code - INMNM inmaname - 1 freq |
INMANAME |
| Time to execute Levenshtein function - 0.213321 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.375441 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.029652 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.037307 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.000880 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. |