| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hillbillies (0) - 3 freq €œhillbillies (2) - 2 freq i'billies (3) - 1 freq iyillies (4) - 1 freq lillies (4) - 1 freq billies (4) - 14 freq hillies (4) - 11 freq ill-willie (4) - 4 freq hillsides (4) - 2 freq hullfulls (5) - 1 freq phillipines (5) - 2 freq hillie (5) - 1 freq frillies (5) - 1 freq hillaireous (5) - 1 freq baillies (5) - 3 freq chilbiains (5) - 1 freq willball (5) - 1 freq lilies (5) - 19 freq lillias (5) - 1 freq allwullie's (5) - 2 freq eild-ills (5) - 1 freq chilblains (5) - 6 freq bellies (5) - 21 freq lillilus (5) - 1 freq billie (5) - 33 freq |
hillbillies (0) - 3 freq €œhillbillies (4) - 2 freq hollywills (6) - 2 freq hullfulls (6) - 1 freq i'billies (6) - 1 freq lillilus (7) - 1 freq willball (7) - 1 freq hillsides (7) - 2 freq billies (7) - 14 freq hillies (7) - 11 freq lillies (7) - 1 freq follicles (8) - 1 freq bullies (8) - 4 freq hairyollies (8) - 2 freq bilabials (8) - 1 freq dellbell (8) - 1 freq stabillis (8) - 1 freq hillwalker (8) - 1 freq hillwalkin (8) - 4 freq lollies (8) - 2 freq allwullie (8) - 6 freq hollies (8) - 2 freq fullfilled (8) - 1 freq syllables (8) - 8 freq holywullie (8) - 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 - HLBLS hillbillies - 3 freq €œhillbillies - 2 freq |
HILLBILLIES |
| Time to execute Levenshtein function - 0.367902 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.879316 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.087619 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.102475 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.000800 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. |