| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hauf-blin (0) - 1 freq half-blin (1) - 1 freq hauf-yin (2) - 10 freq hauf-lit (2) - 4 freq hauflin (2) - 14 freq hauf-muin (2) - 1 freq hauf-apen (3) - 2 freq haulin (3) - 19 freq hauflie (3) - 1 freq hauf-tuim (3) - 1 freq halflin (3) - 14 freq hauf-deid (3) - 8 freq hauflins (3) - 7 freq hauf-hopin (3) - 2 freq haunlin (3) - 5 freq hauf-won (3) - 1 freq haufling (3) - 1 freq haundlin (3) - 10 freq haunnlin (3) - 1 freq hauf-pint (3) - 1 freq hauf-leid (3) - 1 freq humblin (3) - 1 freq halfling (4) - 1 freq yabblin (4) - 2 freq haulen (4) - 10 freq |
hauf-blin (0) - 1 freq half-blin (2) - 1 freq hauf-muin (4) - 1 freq hauflin (4) - 14 freq hauf-lit (4) - 4 freq hauf-yin (4) - 10 freq hauf-hopin (5) - 2 freq hauf-bauld (5) - 1 freq humblin (5) - 1 freq hauf-leid (5) - 1 freq hauf-apen (5) - 2 freq hauf-won (5) - 1 freq hobblin (6) - 2 freq hauf-human (6) - 1 freq has-been (6) - 3 freq hauf-croon (6) - 1 freq aff-blawin (6) - 1 freq hame-bakin (6) - 1 freq fumblin (6) - 1 freq hair-line (6) - 1 freq hauf-etten (6) - 2 freq hauf-loup (6) - 1 freq haunnlin (6) - 1 freq halflin (6) - 14 freq hauf-deid (6) - 8 freq |
SoundEx code - H145 hauflin - 14 freq hauflins - 7 freq hauflin-lad - 1 freq hobblin - 2 freq heffalump - 4 freq huffalamp - 22 freq huffalamps - 1 freq habuliment - 1 freq hufflin-shufflin - 2 freq hipplan - 1 freq habiliment - 1 freq haaflins - 5 freq hauflin's - 1 freq hafflins - 1 freq haiflins - 1 freq habulliments - 1 freq hobbling - 1 freq hauf-blin - 1 freq haufflin-years - 1 freq haufling - 1 freq |
MetaPhone code - HFBLN hauf-blin - 1 freq |
HAUF-BLIN |
| Time to execute Levenshtein function - 0.230507 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.388291 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.028678 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.037091 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.000901 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. |