| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haffets (0) - 6 freq haffet (1) - 5 freq haffit (2) - 1 freq gaffers (2) - 2 freq oaffers (2) - 1 freq taffeta (2) - 1 freq hamlets (2) - 1 freq haets (2) - 2 freq heffers (2) - 1 freq affects (2) - 10 freq haufers (2) - 4 freq affens (2) - 8 freq affest (3) - 1 freq helmets (3) - 9 freq haeps (3) - 4 freq haufs (3) - 5 freq carpets (3) - 8 freq gadgets (3) - 6 freq hanfaes (3) - 1 freq haunels (3) - 1 freq haft (3) - 2 freq yaffs (3) - 1 freq hazels (3) - 2 freq hares (3) - 14 freq haglet (3) - 1 freq |
haffets (0) - 6 freq haffet (2) - 5 freq heffers (3) - 1 freq haffit (3) - 1 freq haufwits (4) - 2 freq affens (4) - 8 freq hefts (4) - 39 freq haufers (4) - 4 freq huffs (4) - 2 freq hufft (4) - 1 freq affects (4) - 10 freq oaffers (4) - 1 freq taffeta (4) - 1 freq hamlets (4) - 1 freq haets (4) - 2 freq gaffers (4) - 2 freq houffs (5) - 1 freq daffys (5) - 1 freq baffies (5) - 21 freq howlets (5) - 1 freq daffies (5) - 4 freq haerts (5) - 19 freq coffees (5) - 1 freq chafft (5) - 1 freq halfweys (5) - 1 freq |
SoundEx code - H132 hauf-a-dizzen - 6 freq haufa-dizzen - 1 freq habits - 23 freq haffets - 6 freq hauf-wits - 1 freq haufdecent - 1 freq hauf-dizzen - 1 freq habit's - 1 freq hauf-decent - 1 freq hefts - 39 freq hypothecat - 1 freq hypothecated - 1 freq hauf-thoosand - 1 freq habités - 1 freq hypothesis - 1 freq haufwits - 2 freq haufwey-daicent - 1 freq habitus - 1 freq hpetycdbhp - 1 freq hbdxuh - 1 freq happydays - 6 freq |
MetaPhone code - HFTS haffets - 6 freq hefts - 39 freq |
HAFFETS |
| Time to execute Levenshtein function - 0.185181 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.380747 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.030850 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.038625 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.001051 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. |