| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| halfgaets (0) - 1 freq haafgaits (2) - 1 freq hanfaes (3) - 1 freq halfleens (3) - 1 freq haffets (3) - 6 freq halfweys (3) - 1 freq halfdan's (3) - 1 freq calfie's (4) - 1 freq halfdan (4) - 5 freq callets (4) - 1 freq hatchets (4) - 1 freq haltet (4) - 1 freq affgaeng (4) - 1 freq halfins (4) - 1 freq targets (4) - 6 freq halples (4) - 1 freq halfway (4) - 7 freq mallaes (4) - 1 freq gaets (4) - 4 freq hallans (4) - 1 freq halieness (4) - 1 freq sungaets (4) - 1 freq hallaed (4) - 1 freq aagaits (4) - 2 freq haggart (4) - 3 freq |
halfgaets (0) - 1 freq haafgaits (3) - 1 freq halfweys (5) - 1 freq haffets (5) - 6 freq halfleens (5) - 1 freq halfÂ’s (6) - 1 freq haufwits (6) - 2 freq helmets (6) - 9 freq halfords (6) - 2 freq ill-gaits (6) - 1 freq halliget (6) - 1 freq halts (6) - 1 freq hauf-gates (6) - 1 freq helgas (6) - 1 freq halflins (6) - 29 freq halfins (6) - 1 freq halfdan's (6) - 1 freq hanfaes (6) - 1 freq half-day's (7) - 1 freq helmits (7) - 1 freq halfa (7) - 2 freq holibags (7) - 2 freq ballants (7) - 15 freq calgacus (7) - 3 freq tairgets (7) - 1 freq |
SoundEx code - H412 half-biggit - 1 freq hallbjorn - 1 freq helps - 56 freq half-cousin - 1 freq half-shut - 4 freq help's - 3 freq half-smile - 1 freq haulf-biggit - 1 freq half-croons - 1 freq half-sa - 1 freq half-past - 7 freq holibags - 2 freq halfgaets - 1 freq hollebeke - 1 freq halfweys - 1 freq half-knelt - 1 freq half-cauld - 1 freq halfcrowns - 1 freq halbsprache - 1 freq half-echt - 1 freq half-grown - 4 freq half-shelt - 1 freq halps - 1 freq half-eight - 1 freq half-scotch - 1 freq €˜helps - 1 freq half-shapit - 1 freq half-conscious - 1 freq hlvcohuyed - 1 freq halves - 1 freq hlphqtblvp - 1 freq halfÂ’s - 1 freq holbycity - 8 freq holiebags - 1 freq halifaxbank - 1 freq |
MetaPhone code - HLFKTS halfgaets - 1 freq |
HALFGAETS |
| Time to execute Levenshtein function - 0.228369 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.392807 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.029472 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.039371 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.001036 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. |