| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| halter (0) - 5 freq walter (1) - 57 freq haeter (1) - 2 freq halper (1) - 2 freq alter (1) - 15 freq hater (1) - 2 freq haltet (1) - 1 freq helter (1) - 3 freq shalter (1) - 4 freq hatter (1) - 279 freq aalter (1) - 1 freq halted (1) - 2 freq falter (1) - 1 freq balmer (2) - 2 freq caler (2) - 1 freq salted (2) - 5 freq haled (2) - 1 freq halled (2) - 2 freq haltit (2) - 3 freq hasher (2) - 1 freq walters (2) - 4 freq aaltar (2) - 2 freq water (2) - 258 freq heiter (2) - 1 freq hatr (2) - 3 freq |
halter (0) - 5 freq helter (1) - 3 freq shalter (2) - 4 freq hatter (2) - 279 freq falter (2) - 1 freq halted (2) - 2 freq aalter (2) - 1 freq haltet (2) - 1 freq walter (2) - 57 freq haeter (2) - 2 freq halper (2) - 2 freq alter (2) - 15 freq hater (2) - 2 freq hulters (3) - 2 freq melter (3) - 1 freq hotter (3) - 8 freq haister (3) - 2 freq laeter (3) - 1 freq hunter (3) - 48 freq altar (3) - 23 freq halts (3) - 1 freq holler (3) - 2 freq laiter (3) - 4 freq hetter (3) - 5 freq heater (3) - 13 freq |
SoundEx code - H436 holders - 3 freq halter - 5 freq helter - 3 freq helter-skelter - 2 freq healthier - 5 freq hold-yir - 1 freq holo-door - 4 freq holodoor - 1 freq huldrych - 1 freq hulters - 2 freq healthers - 1 freq heel-tramped - 2 freq holder - 2 freq heliotrope - 1 freq holywoodtrust - 2 freq |
MetaPhone code - HLTR halter - 5 freq helter - 3 freq holo-door - 4 freq holodoor - 1 freq holder - 2 freq |
HALTER |
| Time to execute Levenshtein function - 0.242570 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.395345 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.028314 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.038057 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.000983 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. |