| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xenophobia (0) - 7 freq xenophobic (1) - 5 freq acrophobia (3) - 1 freq transphobia (4) - 3 freq anglophobia (4) - 1 freq fatphobia (4) - 2 freq homophobic (4) - 3 freq euphoria (4) - 4 freq phobia (4) - 3 freq transphobic (5) - 2 freq homophobe (5) - 1 freq glenaphooka (5) - 1 freq benphilip (5) - 4 freq cacophonie (5) - 1 freq ophelia (5) - 2 freq kenobi (5) - 1 freq euphoric (5) - 3 freq sophia (5) - 2 freq technophobe (5) - 2 freq fatphobic (5) - 1 freq xenonhornet (5) - 2 freq ergophobics (5) - 1 freq heidphone (6) - 2 freq norrowa (6) - 26 freq seraphic (6) - 1 freq |
xenophobia (0) - 7 freq xenophobic (2) - 5 freq acrophobia (5) - 1 freq phobia (6) - 3 freq fatphobia (6) - 2 freq homophobe (7) - 1 freq euphoria (7) - 4 freq anglophobia (7) - 1 freq transphobia (7) - 3 freq homophobic (7) - 3 freq fatphobic (8) - 1 freq technophobe (8) - 2 freq xanthin (8) - 1 freq janephi (8) - 1 freq sophia (8) - 2 freq sinophile (8) - 1 freq nanophase (8) - 1 freq cacophonie (8) - 1 freq glenaphooka (8) - 1 freq benphilip (8) - 4 freq ophelia (8) - 2 freq kenobi (8) - 1 freq metaphor (9) - 13 freq exposin (9) - 6 freq snomob (9) - 1 freq |
SoundEx code - X511 xenophobia - 7 freq xenophobic - 5 freq |
MetaPhone code - SNFB xenophobia - 7 freq xnfb - 1 freq |
XENOPHOBIA |
| Time to execute Levenshtein function - 0.209408 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.367511 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.027525 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.037289 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.000815 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. |