| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| homophobe (0) - 1 freq homophones (2) - 2 freq homophons (2) - 1 freq homophobic (2) - 3 freq allophone (4) - 1 freq horoscope (4) - 1 freq loopholes (4) - 1 freq compose (4) - 6 freq saxophone (4) - 2 freq heidphone (4) - 2 freq hoo-hooer (4) - 1 freq homepage (4) - 1 freq hohoho (4) - 2 freq hoochin (5) - 2 freq dootsome (5) - 1 freq moothie (5) - 4 freq polyphony (5) - 3 freq companie (5) - 32 freq hamnavoe (5) - 4 freq comprise (5) - 1 freq comethe (5) - 1 freq sophie (5) - 11 freq improve (5) - 25 freq hoodie (5) - 17 freq cacophonie (5) - 1 freq |
homophobe (0) - 1 freq homophobic (3) - 3 freq homophones (4) - 2 freq homophons (4) - 1 freq humph (6) - 15 freq humphin (6) - 18 freq humphed (6) - 9 freq humphit (6) - 1 freq homepage (6) - 1 freq humphs (6) - 2 freq hmph (6) - 1 freq humphy (6) - 52 freq humphd (6) - 1 freq heidphone (6) - 2 freq humphrey (6) - 1 freq camphe (7) - 1 freq hemisphere (7) - 2 freq bumphlie (7) - 1 freq hmmph (7) - 8 freq humphers (7) - 1 freq samphire (7) - 1 freq hiphop (7) - 1 freq xenophobia (7) - 7 freq humpie (7) - 1 freq sumphie (7) - 1 freq |
SoundEx code - H511 humphie-back - 1 freq humfy-backit - 1 freq humphy-backit - 6 freq humpie-backit - 1 freq haunbuffed - 1 freq humphie-backit - 1 freq humpybackit - 1 freq homophobic - 3 freq homophobe - 1 freq |
MetaPhone code - HMFB homophobe - 1 freq |
HOMOPHOBE |
| Time to execute Levenshtein function - 0.225347 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.390658 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.028414 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.039219 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.000926 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. |