Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
heroicis (0) - 2 freq heroic (2) - 8 freq heroines (2) - 1 freq rejoicin (3) - 2 freq herriein (3) - 1 freq heroes (3) - 39 freq 'eric's (3) - 1 freq hercus (3) - 1 freq aerobics (3) - 3 freq jerriais (3) - 1 freq heroine (3) - 6 freq hertiess (3) - 1 freq heronious (3) - 3 freq herrin's (3) - 1 freq heichs (3) - 2 freq herries (3) - 4 freq herrins (3) - 2 freq herodias (3) - 4 freq herons (3) - 3 freq eric's (3) - 8 freq hertilie (3) - 1 freq herod's (3) - 7 freq heroin (3) - 5 freq servicin (3) - 1 freq herdins (3) - 3 freq |
heroicis (0) - 2 freq hercus (3) - 1 freq heroines (3) - 1 freq heroic (3) - 8 freq herodias (4) - 4 freq heros (4) - 1 freq heronious (4) - 3 freq herries (4) - 4 freq herons (4) - 3 freq hero's (4) - 3 freq heris (4) - 1 freq heroes (4) - 39 freq heres (5) - 8 freq hurries (5) - 3 freq herks (5) - 1 freq herc (5) - 1 freq ferocious (5) - 4 freq hornies (5) - 1 freq hers (5) - 85 freq hera's (5) - 1 freq here's (5) - 269 freq hartis (5) - 1 freq herds (5) - 20 freq hardies (5) - 1 freq hurdies (5) - 27 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 - 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 |
HEROICIS |
Time to execute Levenshtein function - 0.206947 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.401766 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.027444 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.037677 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.000957 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. |