| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haafgaits (0) - 1 freq halfgaets (2) - 1 freq aagaits (2) - 2 freq hauf-wits (3) - 1 freq haaflins (3) - 5 freq naegaits (3) - 5 freq haufwits (3) - 2 freq awgaits (3) - 4 freq affairs (4) - 42 freq habitats (4) - 4 freq haafwyes (4) - 1 freq haiflins (4) - 1 freq hancairts (4) - 1 freq braggarts (4) - 1 freq canigait (4) - 1 freq sairgants (4) - 1 freq haffit (4) - 1 freq onygaits (4) - 7 freq haandit (4) - 8 freq agait (4) - 1 freq halfdan's (4) - 1 freq awaits (4) - 8 freq haffets (4) - 6 freq haizarts (4) - 1 freq wha-haits (4) - 1 freq |
haafgaits (0) - 1 freq halfgaets (3) - 1 freq aagaits (4) - 2 freq haufwits (4) - 2 freq hauf-gates (5) - 1 freq haffets (5) - 6 freq awgaits (5) - 4 freq naegaits (5) - 5 freq hauf-wits (5) - 1 freq haaflins (5) - 5 freq €œgaits (6) - 1 freq amangits (6) - 1 freq gaits (6) - 30 freq somegaits (6) - 3 freq hangit (6) - 12 freq habits (6) - 23 freq haufwit (6) - 2 freq hauflins (6) - 7 freq hoagies (6) - 1 freq haaf's (6) - 1 freq harigals (6) - 4 freq haggis (6) - 76 freq haggit (6) - 3 freq hefts (6) - 39 freq onygaits (6) - 7 freq |
SoundEx code - H123 hauf-biggit - 2 freq hauf-shut - 2 freq hauf-past - 7 freq heavy-set - 1 freq hauf-steikit - 2 freq happiest - 10 freq haufbiggit - 1 freq hipster - 3 freq hauf-chaaed - 1 freq heavy-weight - 1 freq heavy-shoodered - 1 freq hivviest - 1 freq hobbyists - 1 freq haafgaits - 1 freq hauf-stirred - 1 freq heaviest - 2 freq hopscotch - 3 freq hauf-gates - 1 freq hephaestus - 2 freq hauf-baked - 1 freq heavyweicht - 1 freq hyvast - 6 freq hevagidday - 1 freq heeposhit - 1 freq havester - 1 freq hbctyy - 1 freq hbkxcdgvss - 1 freq hubster - 1 freq hfqwd - 1 freq heavyweight - 1 freq hipsters - 1 freq hbjgtize - 1 freq |
MetaPhone code - HFKTS haafgaits - 1 freq hauf-gates - 1 freq |
HAAFGAITS |
| Time to execute Levenshtein function - 0.202790 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.389434 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.029790 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.043669 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.000955 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. |