Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
xenophobic (0) - 5 freq xenophobia (1) - 7 freq homophobic (3) - 3 freq transphobic (4) - 2 freq ergophobics (4) - 1 freq euphoric (4) - 3 freq acrophobia (4) - 1 freq fatphobic (4) - 1 freq phobia (5) - 3 freq cacophonie (5) - 1 freq xenonhornet (5) - 2 freq euphoria (5) - 4 freq kenobi (5) - 1 freq phonic (5) - 2 freq geologic (5) - 3 freq prophetic (5) - 2 freq homophobe (5) - 1 freq pentatonic (5) - 1 freq seraphic (5) - 1 freq economic (5) - 79 freq anti-xenophobic (5) - 1 freq alcoholic (5) - 6 freq benphilip (5) - 4 freq aesopic (5) - 1 freq anglophobia (5) - 1 freq |
xenophobic (0) - 5 freq xenophobia (2) - 7 freq homophobic (5) - 3 freq fatphobic (6) - 1 freq ergophobics (7) - 1 freq acrophobia (7) - 1 freq transphobic (7) - 2 freq euphoric (7) - 3 freq anti-xenophobic (8) - 1 freq seraphic (8) - 1 freq benphilip (8) - 4 freq polyphonic (8) - 2 freq eosinophilic (8) - 1 freq homophobe (8) - 1 freq emphatic (8) - 4 freq fatphobia (8) - 2 freq phonic (8) - 2 freq phobia (8) - 3 freq prophetic (8) - 2 freq cacophonie (9) - 1 freq sinophile (9) - 1 freq aodhbc (9) - 4 freq inpic (9) - 1 freq xanthin (9) - 1 freq xhoc (9) - 1 freq |
SoundEx code - X511 xenophobia - 7 freq xenophobic - 5 freq |
MetaPhone code - SNFBK xenophobic - 5 freq |
XENOPHOBIC |
Time to execute Levenshtein function - 0.194316 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.359867 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.028026 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.040365 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.000827 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. |