| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harsh-strung (0) - 1 freq harp-strung (2) - 1 freq saut-stung (5) - 1 freq armstrang (5) - 1 freq hairth-rug (5) - 1 freq hearth-rug (5) - 1 freq draa-string (5) - 1 freq hearth-stane (5) - 1 freq herth-rug (5) - 1 freq armstrong (5) - 15 freq washstand (6) - 1 freq owerstrung (6) - 1 freq hert-rug (6) - 2 freq hearthrug (6) - 2 freq hause-baund (6) - 2 freq new-sprung (6) - 1 freq mask-strength (6) - 1 freq gut-sprung (6) - 1 freq hertrug (6) - 1 freq haunstauns (6) - 1 freq earth-bound (6) - 1 freq armstrong' (6) - 1 freq hairst-rig (6) - 1 freq hashing (6) - 2 freq harsher (6) - 2 freq |
harsh-strung (0) - 1 freq harp-strung (4) - 1 freq draa-string (8) - 1 freq hearth-stane (8) - 1 freq herth-rug (9) - 1 freq horsie-steen (9) - 2 freq armstrong (9) - 15 freq richtstrong (9) - 1 freq saut-stung (9) - 1 freq hearth-rug (9) - 1 freq hairth-rug (9) - 1 freq armstrang (9) - 1 freq girth-strap (10) - 1 freq airmstrong (10) - 5 freq hairst-rig (10) - 1 freq drawstring (10) - 1 freq owerstrung (10) - 1 freq hertstrings (10) - 1 freq hert-sten (10) - 1 freq horse-tradin (11) - 1 freq hauf-serene (11) - 1 freq samuelstrange (11) - 1 freq harsing (11) - 1 freq hairth-rugs (11) - 1 freq cash-tray (11) - 1 freq |
SoundEx code - H622 horses - 113 freq horses' - 10 freq horsegowk - 1 freq horseshoe - 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 - HRXSTRNK harsh-strung - 1 freq |
HARSH-STRUNG |
| Time to execute Levenshtein function - 0.231275 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.423324 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.036158 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.042929 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.000840 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. |