| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| imminently (0) - 1 freq eminently (2) - 2 freq imminent (2) - 4 freq iminent (3) - 1 freq impiddently (3) - 1 freq diligently (4) - 5 freq mintly (4) - 1 freq silently (4) - 32 freq praisently (4) - 2 freq immensely (4) - 2 freq immunity (4) - 3 freq inherently (4) - 1 freq eidently (4) - 16 freq pairently (4) - 1 freq patiently (4) - 28 freq impident (4) - 8 freq accidently (4) - 1 freq reminent's (4) - 1 freq intently (4) - 10 freq innocently (4) - 2 freq stridently (4) - 1 freq ineptly (4) - 1 freq impatiently (4) - 20 freq minents (4) - 1 freq evidently (4) - 25 freq |
imminently (0) - 1 freq imminent (3) - 4 freq eminently (3) - 2 freq iminent (5) - 1 freq immunity (6) - 3 freq impatiently (6) - 20 freq immensely (6) - 2 freq immedantlie (6) - 4 freq permanently (6) - 6 freq mintly (6) - 1 freq impiddently (6) - 1 freq minents (6) - 1 freq immediantlie (7) - 1 freq raicently (7) - 20 freq femininity (7) - 2 freq immediately (7) - 85 freq ruminants (7) - 1 freq mannerly (7) - 1 freq maiment (7) - 2 freq dominant (7) - 19 freq indignantly (7) - 10 freq immanuel (7) - 1 freq mennerly (7) - 2 freq immedanthe (7) - 1 freq poignantly (7) - 1 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 - IMNNTL imminently - 1 freq |
IMMINENTLY |
| Time to execute Levenshtein function - 0.226618 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.391422 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.028058 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.037646 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.000929 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. |