| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| horrors (0) - 18 freq horror's (1) - 1 freq horror (1) - 50 freq horrals (2) - 1 freq sorrows (2) - 10 freq horrur (2) - 2 freq errors (2) - 7 freq hoors (2) - 50 freq mirrors (2) - 25 freq terrors (2) - 3 freq morrows (2) - 1 freq horrer (2) - 1 freq horro (2) - 1 freq govnors (3) - 4 freq hoo's (3) - 14 freq moors (3) - 6 freq arrows (3) - 4 freq howders (3) - 2 freq werrers (3) - 1 freq hoos (3) - 21 freq mirror's (3) - 1 freq hurrays (3) - 1 freq heritors (3) - 5 freq corries (3) - 15 freq marros (3) - 1 freq |
horrors (0) - 18 freq horror (2) - 50 freq horror's (2) - 1 freq terrors (3) - 3 freq horrer (3) - 1 freq mirrors (3) - 25 freq harriers (3) - 2 freq horrals (3) - 1 freq horrur (3) - 2 freq errors (3) - 7 freq horrorseen (4) - 1 freq harrys (4) - 2 freq herders (4) - 1 freq harris (4) - 14 freq harbours (4) - 2 freq harras (4) - 1 freq herrs (4) - 1 freq herries (4) - 4 freq herbours (4) - 2 freq hurries (4) - 3 freq harry's (4) - 8 freq hoarders (4) - 1 freq harrouis (4) - 1 freq harrans (4) - 1 freq warriors (4) - 20 freq |
SoundEx code - H662 horrors - 18 freq 'horrorscopes' - 1 freq hierarchies - 2 freq horror's - 1 freq heirarchies - 1 freq harriers - 2 freq hierarchical - 1 freq hierarchy - 2 freq horrorseen - 1 freq |
MetaPhone code - HRRS horrors - 18 freq horror's - 1 freq harriers - 2 freq |
HORRORS |
| Time to execute Levenshtein function - 0.198904 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.360844 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.029067 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.044145 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.000854 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. |