| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haad-aff (0) - 1 freq wan-aff (3) - 2 freq far-aff (3) - 6 freq haancuff (3) - 4 freq tap-aff (3) - 1 freq 'tap-aff (3) - 1 freq cast-aff (3) - 2 freq hyne-aff (3) - 1 freq send-aff (3) - 1 freq sair-aff (3) - 3 freq haadan (3) - 2 freq faur-aff (3) - 10 freq ane-aff (3) - 4 freq handbag (4) - 21 freq handcart (4) - 1 freq staun-aff (4) - 2 freq handbags (4) - 2 freq haedan (4) - 3 freq aa-an (4) - 1 freq hauf-fu (4) - 2 freq haaden (4) - 2 freq haalan (4) - 2 freq hand-out (4) - 1 freq half-awa (4) - 2 freq wan-off (4) - 1 freq |
haad-aff (0) - 1 freq hyne-aff (4) - 1 freq send-aff (5) - 1 freq faur-aff (5) - 10 freq ane-aff (5) - 4 freq wan-aff (5) - 2 freq sair-aff (5) - 3 freq far-aff (5) - 6 freq tap-aff (5) - 1 freq haancuff (5) - 4 freq play-off (6) - 1 freq leader-aff (6) - 2 freq heid-at (6) - 1 freq wan-off (6) - 1 freq rip-aff (6) - 3 freq yin-aff (6) - 1 freq weel-aff (6) - 28 freq ill-aff (6) - 6 freq haff (6) - 4 freq daff (6) - 5 freq haadan (6) - 2 freq cast-aff (6) - 2 freq 'tap-aff (6) - 1 freq sound-aff (6) - 1 freq one-aff (6) - 1 freq |
SoundEx code - H310 heid-the-baw - 4 freq heedfu - 1 freq hatefu - 5 freq http - 482 freq hdöv - 1 freq haad-aff - 1 freq heatwave - 3 freq howdiewife - 1 freq htp - 1 freq hethaibfp - 1 freq |
MetaPhone code - HTF heedfu - 1 freq hatefu - 5 freq haad-aff - 1 freq |
HAAD-AFF |
| Time to execute Levenshtein function - 0.204906 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.389181 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.029818 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.041258 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.000894 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. |