| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| halfords (0) - 2 freq halyards (2) - 1 freq alford (2) - 4 freq mallards (3) - 2 freq halfs (3) - 1 freq almonds (3) - 2 freq haufers (3) - 4 freq caloris (3) - 2 freq mallord (3) - 1 freq haycorns (3) - 13 freq lawlords (3) - 1 freq halfweys (3) - 1 freq hazards (3) - 1 freq halo's (3) - 1 freq 'afford (3) - 1 freq wilford (3) - 1 freq fords (3) - 1 freq hallows (3) - 2 freq balfour's (3) - 1 freq halberd's (3) - 1 freq hanfoos (3) - 1 freq warlords (3) - 1 freq hallow's (3) - 1 freq halfins (3) - 1 freq taywords (3) - 1 freq |
halfords (0) - 2 freq halyards (3) - 1 freq alford (4) - 4 freq hazards (5) - 1 freq halfweys (5) - 1 freq halfins (5) - 1 freq balfour's (5) - 1 freq fords (5) - 1 freq wilford (5) - 1 freq halflins (5) - 29 freq halfs (5) - 1 freq mallards (5) - 2 freq halberd's (5) - 1 freq haufers (5) - 4 freq lords (5) - 27 freq halyard (5) - 1 freq loards (6) - 1 freq hunnerds (6) - 1 freq halidays (6) - 1 freq alfred (6) - 12 freq railroads (6) - 1 freq hoards (6) - 4 freq heefers (6) - 1 freq helpers (6) - 12 freq hirds (6) - 8 freq |
SoundEx code - H416 helper - 5 freq half-frozen - 1 freq hellfire - 4 freq half-hairted - 1 freq hell-fire - 1 freq helpers - 12 freq hallvard - 2 freq hellebore - 1 freq halliburton - 1 freq hill-forts - 1 freq halfords - 2 freq half-fairt - 1 freq help-yersel - 1 freq half-heartedly - 1 freq half-written - 1 freq hellyiefers - 1 freq halberd's - 1 freq halbert - 2 freq half-rotten - 1 freq half-hearted - 1 freq heliport - 2 freq halper - 2 freq half-hard - 2 freq hellyeifers - 1 freq hillberry - 1 freq holburn - 3 freq heilbronn - 3 freq |
MetaPhone code - HLFRTS hill-forts - 1 freq halfords - 2 freq |
HALFORDS |
| Time to execute Levenshtein function - 0.230873 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.382413 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.029100 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.043232 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.000999 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. |