| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| horrer (0) - 1 freq horter (1) - 1 freq horner (1) - 2 freq orrer (1) - 1 freq horror (1) - 50 freq horrur (1) - 2 freq corer (2) - 1 freq hordes (2) - 1 freq order (2) - 278 freq nerrer (2) - 2 freq corner (2) - 324 freq horsed (2) - 3 freq horse' (2) - 1 freq hotter (2) - 8 freq hozier (2) - 1 freq yorker (2) - 1 freq poorer (2) - 5 freq hoker (2) - 1 freq hooler (2) - 1 freq herber (2) - 5 freq howder (2) - 1 freq horde (2) - 2 freq forder (2) - 97 freq harder (2) - 67 freq horse (2) - 237 freq |
horrer (0) - 1 freq horrur (1) - 2 freq horror (1) - 50 freq harrier (2) - 2 freq horter (2) - 1 freq horner (2) - 2 freq orrer (2) - 1 freq worrier (3) - 1 freq herer (3) - 1 freq harper (3) - 3 freq ferrer (3) - 8 freq narrer (3) - 2 freq horro (3) - 1 freq horrors (3) - 18 freq farrer (3) - 27 freq herder (3) - 3 freq horrid (3) - 9 freq hearer (3) - 1 freq hoarder (3) - 2 freq hirer (3) - 2 freq hornier (3) - 1 freq harder (3) - 67 freq hermer (3) - 1 freq horreed (3) - 1 freq herber (3) - 5 freq |
SoundEx code - H660 horror - 50 freq herer - 1 freq horrer - 1 freq hirer - 2 freq hairier - 2 freq hearer - 1 freq harrier - 2 freq horrur - 2 freq |
MetaPhone code - HRR horror - 50 freq herer - 1 freq horrer - 1 freq hirer - 2 freq hairier - 2 freq hearer - 1 freq harrier - 2 freq horrur - 2 freq |
HORRER |
| Time to execute Levenshtein function - 0.217928 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.408650 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.027808 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.037244 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.000935 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. |