| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| immense (0) - 11 freq immerse (1) - 3 freq immersd (2) - 1 freq mense (2) - 60 freq incense (2) - 10 freq immensely (2) - 2 freq immune (2) - 6 freq immers (2) - 2 freq insense (2) - 7 freq immersed (2) - 4 freq intense (2) - 24 freq pense (3) - 3 freq simmins (3) - 1 freq decense (3) - 1 freq simmets (3) - 2 freq defense (3) - 1 freq gimmers (3) - 3 freq meenie (3) - 68 freq menses (3) - 1 freq mensie (3) - 1 freq mens (3) - 2 freq ileene (3) - 1 freq ameuse (3) - 1 freq insensed (3) - 4 freq impose (3) - 10 freq |
immense (0) - 11 freq immerse (2) - 3 freq immune (3) - 6 freq immers (3) - 2 freq immensely (3) - 2 freq mense (3) - 60 freq meens (4) - 3 freq maens (4) - 3 freq mens (4) - 2 freq omens (4) - 3 freq immunised (4) - 2 freq emmers (4) - 4 freq mensa (4) - 1 freq simmons (4) - 1 freq mensie (4) - 1 freq womens (4) - 3 freq manse (4) - 18 freq immanuel (4) - 1 freq immersed (4) - 4 freq insense (4) - 7 freq incense (4) - 10 freq immersd (4) - 1 freq intense (4) - 24 freq simmins (4) - 1 freq wimmins (4) - 4 freq |
SoundEx code - I552 inions - 1 freq immense - 11 freq immunised - 2 freq innins - 16 freq immensely - 2 freq i'meenister - 1 freq i'mannie's - 1 freq inimies - 2 freq inemies - 3 freq inning - 1 freq immensities - 1 freq ionamckay - 11 freq |
MetaPhone code - IMNS immense - 11 freq i'mannie's - 1 freq |
IMMENSE |
| Time to execute Levenshtein function - 0.167630 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.370151 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.027255 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.036588 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.000941 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. |