| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| halfling (0) - 1 freq halflins (1) - 29 freq halflin (1) - 14 freq haufling (1) - 1 freq handling (2) - 1 freq haiflins (2) - 1 freq halfin (2) - 1 freq hafflins (2) - 1 freq calling (2) - 15 freq baffling (2) - 1 freq haunling (2) - 6 freq hauflins (2) - 7 freq hauling (2) - 1 freq falling (2) - 10 freq haaflins (2) - 5 freq hauflin (2) - 14 freq halfins (2) - 1 freq halplie (3) - 1 freq haundling (3) - 2 freq dazzling (3) - 2 freq karling (3) - 1 freq haining (3) - 6 freq hannlins (3) - 39 freq wailing (3) - 1 freq callin (3) - 30 freq |
halfling (0) - 1 freq halflin (2) - 14 freq haufling (2) - 1 freq halflins (2) - 29 freq falling (4) - 10 freq hauling (4) - 1 freq haaflins (4) - 5 freq halfleens (4) - 1 freq hauflins (4) - 7 freq halfins (4) - 1 freq hauflin (4) - 14 freq handling (4) - 1 freq haunling (4) - 6 freq halfin (4) - 1 freq haiflins (4) - 1 freq calling (4) - 15 freq baffling (4) - 1 freq hafflins (4) - 1 freq huddling (5) - 1 freq shuffling (5) - 1 freq rolling (5) - 7 freq humbling (5) - 1 freq helpline (5) - 10 freq helping (5) - 23 freq milling (5) - 1 freq |
SoundEx code - H414 helpless - 17 freq helplessly - 7 freq halflin - 14 freq halflins - 29 freq helpful - 6 freq half-blin - 1 freq halpless - 1 freq half-full - 1 freq helpline - 10 freq hillbillies - 3 freq hullabaloo - 1 freq half-believe - 1 freq half-lippenin - 1 freq half-believed - 1 freq half-laughed - 1 freq half-fill - 1 freq halfleens - 1 freq hullfulls - 1 freq halplie - 1 freq halples - 1 freq half-licht - 1 freq helpfully - 1 freq €œhillbillies - 2 freq helplessness - 2 freq half-listenin - 1 freq halplessness - 1 freq halfling - 1 freq |
MetaPhone code - HLFLNK halfling - 1 freq |
HALFLING |
| Time to execute Levenshtein function - 0.206070 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.368753 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.027657 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.038311 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.000948 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. |