| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| immunity (0) - 3 freq impunity (1) - 3 freq community (2) - 254 freq tunity (3) - 1 freq insanity (3) - 4 freq infinity (3) - 1 freq unity (3) - 45 freq humanity (3) - 30 freq meenity (3) - 2 freq commonity (3) - 177 freq 'community (3) - 2 freq commuity (3) - 1 freq immune (3) - 6 freq community' (3) - 2 freq ammonite (3) - 1 freq immunised (3) - 2 freq salinity (4) - 1 freq impit (4) - 1 freq brunty (4) - 1 freq innimy (4) - 1 freq reunite (4) - 1 freq bounty (4) - 10 freq jaunty (4) - 2 freq inuits (4) - 2 freq ignite (4) - 4 freq |
immunity (0) - 3 freq impunity (2) - 3 freq ammonite (3) - 1 freq community (3) - 254 freq humanity (4) - 30 freq immune (4) - 6 freq meenity (4) - 2 freq commonity (4) - 177 freq mynit (5) - 1 freq commonty (5) - 22 freq immediat (5) - 1 freq immanuel (5) - 1 freq menit (5) - 2 freq mournit (5) - 1 freq laminit (5) - 1 freq minty (5) - 15 freq minnit (5) - 5 freq memento (5) - 1 freq ammonia (5) - 8 freq mennit (5) - 1 freq munt (5) - 14 freq communitie (5) - 21 freq imminent (5) - 4 freq mannit (5) - 2 freq immense (5) - 11 freq |
SoundEx code - I553 inundated - 2 freq i'month - 1 freq inimities - 1 freq inimitable - 1 freq immunity - 3 freq ianandrewauthor - 1 freq |
MetaPhone code - IMNT immunity - 3 freq |
IMMUNITY |
| Time to execute Levenshtein function - 0.342400 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.526896 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.029644 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.041878 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.000961 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. |