Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hauf-gates (0) - 1 freq half-eaten (3) - 2 freq hauf-apen (3) - 2 freq hauf-baked (3) - 1 freq hauf-wits (3) - 1 freq hauf-etten (3) - 2 freq hauf-mete (3) - 1 freq hauf-wyes (3) - 1 freq hauf-grue (3) - 1 freq hauf-masked (4) - 1 freq haufwits (4) - 2 freq halfgaets (4) - 1 freq haud-gauin (4) - 2 freq hauf-wey (4) - 4 freq half-naked (4) - 1 freq hauf-panned (4) - 1 freq hauf-past (4) - 7 freq hauf-day (4) - 1 freq hauf-grown (4) - 1 freq half-day's (4) - 1 freq hauf-daft (4) - 1 freq agates (4) - 1 freq saegates (4) - 1 freq hauf-roads (4) - 7 freq hauf-threy (4) - 1 freq |
hauf-gates (0) - 1 freq hauf-wits (4) - 1 freq hauf-wyes (5) - 1 freq hauf-grue (5) - 1 freq hauf-mete (5) - 1 freq haafgaits (5) - 1 freq hauf-etten (5) - 2 freq hauf-roads (6) - 7 freq hauf-tume (6) - 1 freq hauf-time (6) - 1 freq hauf-lit (6) - 4 freq hauf-seas (6) - 1 freq haufwits (6) - 2 freq hauf-apen (6) - 2 freq hauf-baked (6) - 1 freq half-eaten (6) - 2 freq halfgaets (6) - 1 freq haufwyes (7) - 2 freq hame-bakes (7) - 1 freq sumgates (7) - 1 freq hauf-mast (7) - 3 freq thusgates (7) - 22 freq hauf-sister (7) - 3 freq hauf-tuim (7) - 1 freq hauf-greetin (7) - 1 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 |
HAUF-GATES |
Time to execute Levenshtein function - 0.211386 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.419297 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.029779 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.040404 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.001095 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. |