| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| horsecheer (0) - 1 freq horsesheen (2) - 1 freq horseflee (3) - 1 freq horsehair (3) - 3 freq house-heid (4) - 1 freq forfechten (4) - 2 freq heecher (4) - 1 freq forewheel (4) - 1 freq forgether (4) - 3 freq porsche (4) - 4 freq horse-shoe (4) - 1 freq hooseaiver (4) - 1 freq strechter (4) - 1 freq streecher (4) - 2 freq pushcheer (4) - 1 freq foreheed (4) - 1 freq horsemen (4) - 16 freq horseflesh (4) - 1 freq screechyer (4) - 1 freq harsher (4) - 2 freq hoochter (4) - 1 freq herschel (4) - 1 freq housekeeper (4) - 3 freq horshes (4) - 1 freq hoosekeeper (4) - 8 freq |
horsecheer (0) - 1 freq horsehair (4) - 3 freq horsesheen (4) - 1 freq harsher (5) - 2 freq herschel (5) - 1 freq porsche (6) - 4 freq horshes (6) - 1 freq heecher (6) - 1 freq horseflee (6) - 1 freq hurcheon (7) - 8 freq horchata (7) - 2 freq trencher (7) - 3 freq roucher (7) - 2 freq horoscopes (7) - 1 freq ersche (7) - 1 freq brocher (7) - 2 freq teuscher (7) - 1 freq sicher (7) - 1 freq preacher (7) - 20 freq thresher (7) - 2 freq preesher (7) - 5 freq archer (7) - 9 freq heicher (7) - 30 freq hicher (7) - 1 freq hertache (7) - 1 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 - HRSXR horsecheer - 1 freq |
HORSECHEER |
| Time to execute Levenshtein function - 0.230710 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.370912 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.028523 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.039681 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.000873 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. |