Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
inanundir (0) - 4 freq in-anunder (2) - 1 freq anundir (2) - 1 freq innunner (3) - 2 freq anunder (3) - 44 freq nannie (4) - 4 freq thundir (4) - 1 freq intendit (4) - 25 freq saundie (4) - 1 freq aunsir (4) - 1 freq innnit (4) - 1 freq includin (4) - 133 freq unatendid (4) - 1 freq staundin (4) - 114 freq inhauddin (4) - 1 freq annidir (4) - 1 freq laundit (4) - 11 freq intendin (4) - 3 freq haundie (4) - 1 freq nadir (4) - 1 freq haundin (4) - 18 freq aniddir (4) - 4 freq graunder (4) - 2 freq haundit (4) - 63 freq an'under (4) - 3 freq |
inanundir (0) - 4 freq anundir (3) - 1 freq in-anunder (3) - 1 freq innunner (4) - 2 freq anunder (4) - 44 freq annidir (5) - 1 freq an'under (5) - 3 freq anunner (5) - 1 freq inunner (5) - 1 freq waandir (6) - 1 freq annuncit (6) - 1 freq asunder (6) - 5 freq paunder (6) - 1 freq daunder (6) - 40 freq annidder (6) - 3 freq annider (6) - 3 freq unnder (6) - 1 freq ngender (6) - 1 freq announcer (6) - 1 freq anndra (6) - 2 freq hunnder (6) - 1 freq yundir (6) - 2 freq annand (6) - 10 freq unatendid (6) - 1 freq intendit (6) - 25 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 - INNNTR inanundir - 4 freq in-anunder - 1 freq |
INANUNDIR |
Time to execute Levenshtein function - 0.220544 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.397394 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.027717 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.039312 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.001203 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. |