| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| horses (0) - 113 freq 'horses (1) - 1 freq hordes (1) - 1 freq horsed (1) - 3 freq corses (1) - 1 freq hoses (1) - 1 freq horse's (1) - 7 freq hooses (1) - 251 freq houses (1) - 25 freq horshes (1) - 1 freq horses' (1) - 10 freq hornes (1) - 2 freq horse (1) - 232 freq horsis (1) - 3 freq hotses (1) - 1 freq hoarses (1) - 5 freq horse' (1) - 1 freq horss (1) - 22 freq hures (2) - 1 freq morsels (2) - 4 freq howes (2) - 18 freq tories (2) - 115 freq worser (2) - 3 freq doses (2) - 9 freq nories (2) - 25 freq |
horses (0) - 113 freq horsis (1) - 3 freq hoarses (1) - 5 freq horss (1) - 22 freq hornes (2) - 2 freq horses' (2) - 10 freq hotses (2) - 1 freq horshes (2) - 1 freq horse (2) - 232 freq horse' (2) - 1 freq horsed (2) - 3 freq hordes (2) - 1 freq houses (2) - 25 freq corses (2) - 1 freq 'horses (2) - 1 freq hoses (2) - 1 freq hooses (2) - 251 freq horse's (2) - 7 freq houres (3) - 8 freq purses (3) - 1 freq horus (3) - 1 freq houss (3) - 63 freq coorses (3) - 16 freq heres (3) - 8 freq hoarse (3) - 29 freq |
SoundEx code - H622 horses - 113 freq horses' - 10 freq horsegowk - 1 freq hoarses - 5 freq 'horses - 1 freq horse's - 7 freq horace's - 2 freq hair-skoosh - 1 freq horshes - 1 freq horsie's - 1 freq harsh-strung - 1 freq horsis - 3 freq horse-shoe - 1 freq horsestang-draigon-flee - 1 freq hershaw's - 1 freq horssis - 4 freq horsechestnut - 1 freq horsie-steen - 2 freq horsecheer - 1 freq horse-sodjer - 1 freq herzegovina - 1 freq horse-shaeped - 1 freq horsesheen - 1 freq heroicis - 2 freq hoarsegowk - 1 freq harasses - 1 freq harryjosiegiles - 6 freq horsikie - 1 freq hercus - 1 freq |
MetaPhone code - HRSS horses - 113 freq horses' - 10 freq hoarses - 5 freq 'horses - 1 freq horse's - 7 freq horace's - 2 freq horsie's - 1 freq horsis - 3 freq horssis - 4 freq heroicis - 2 freq harasses - 1 freq |
HORSES |
| Time to execute Levenshtein function - 0.179284 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.477384 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.028128 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.096606 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.000811 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. |