| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| immensely (0) - 2 freq intensely (2) - 4 freq mensely (2) - 1 freq immense (2) - 14 freq immerse (3) - 3 freq immersed (3) - 4 freq tensely (3) - 2 freq immanuel (3) - 1 freq meesery (4) - 5 freq miesel (4) - 1 freq emmanuel (4) - 1 freq meesel (4) - 2 freq mosely (4) - 2 freq mounsey (4) - 1 freq metely (4) - 1 freq easely (4) - 1 freq bensel (4) - 1 freq incensed (4) - 3 freq meself (4) - 2 freq immersin (4) - 1 freq immers (4) - 2 freq maesell (4) - 1 freq eensel (4) - 6 freq immersd (4) - 1 freq aimiessly (4) - 1 freq |
immensely (0) - 2 freq immense (3) - 14 freq mensely (3) - 1 freq immanuel (4) - 1 freq intensely (4) - 4 freq emmanuel (5) - 1 freq immunised (5) - 2 freq tensely (5) - 2 freq immersed (5) - 4 freq immerse (5) - 3 freq mensefu (6) - 40 freq measly (6) - 1 freq immunity (6) - 3 freq menses (6) - 1 freq immediately (6) - 85 freq immersive (6) - 3 freq morosely (6) - 1 freq immune (6) - 6 freq mesel (6) - 59 freq same-sel (6) - 2 freq imsel (6) - 29 freq imminent (6) - 4 freq imminently (6) - 1 freq maesel (6) - 19 freq mense (6) - 60 freq |
SoundEx code - I552 inions - 1 freq immense - 14 freq immunised - 2 freq innins - 17 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 - IMNSL immensely - 2 freq |
IMMENSELY |
| Time to execute Levenshtein function - 0.193593 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.404521 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.027366 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.039075 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.000921 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. |