| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hame-rule (0) - 8 freq hale-sale (3) - 1 freq hame-trowe (3) - 1 freq hame-wurk (3) - 1 freq hame-made (3) - 11 freq hame-help (3) - 1 freq hame-time (3) - 1 freq hamelaun (4) - 1 freq ameuse (4) - 1 freq hame-airt (4) - 1 freq hame-gaun (4) - 5 freq merble (4) - 2 freq humerus (4) - 1 freq hamely (4) - 45 freq shedrule (4) - 1 freq hame-bakes (4) - 1 freq hateful (4) - 4 freq hamebrew (4) - 1 freq misrule (4) - 1 freq hamnle (4) - 1 freq hame-brewed (4) - 1 freq hauf-tume (4) - 1 freq hamelt (4) - 72 freq hameilt (4) - 1 freq hame-trow (4) - 3 freq |
hame-rule (0) - 8 freq hame-help (5) - 1 freq hame-airt (5) - 1 freq hame-made (5) - 11 freq hame-time (5) - 1 freq hale-sale (5) - 1 freq hame-wurk (5) - 1 freq hame-trowe (5) - 1 freq home-help (6) - 1 freq home-made (6) - 1 freq hamnle (6) - 1 freq hame- (6) - 1 freq hame-trow (6) - 3 freq same-sel (6) - 2 freq misrule (6) - 1 freq merle (6) - 5 freq hamewurk (6) - 1 freq hameart (6) - 3 freq hamelie (6) - 2 freq humerus (6) - 1 freq hame-gaun (6) - 5 freq hamebrew (6) - 1 freq hamely (6) - 45 freq 'ammiral (7) - 3 freq hamper (7) - 3 freq |
SoundEx code - H564 hinnerlie - 10 freq hinnerly - 1 freq hame-rule - 8 freq |
MetaPhone code - HMRL hame-rule - 8 freq |
HAME-RULE |
| Time to execute Levenshtein function - 0.228380 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.399167 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.032656 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.038297 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.001028 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. |