| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shalmilleens (0) - 1 freq spaelleens (4) - 1 freq shellmaleens (4) - 2 freq shilleen (4) - 1 freq halfleens (4) - 1 freq shilliens (4) - 1 freq saileens (4) - 1 freq shambles (5) - 30 freq ramilles (5) - 1 freq shameless (5) - 3 freq hulmalees (5) - 1 freq faileens (5) - 1 freq spaelleen (5) - 2 freq spelleens (5) - 3 freq galileans (5) - 3 freq shillins (5) - 19 freq shillans (5) - 2 freq hallaeen (5) - 12 freq hailsteens (5) - 5 freq halloweens (5) - 2 freq haliglen (5) - 1 freq hallaeen's (5) - 1 freq galileeans (5) - 1 freq shairpens (5) - 1 freq sharleen (5) - 1 freq |
shalmilleens (0) - 1 freq shellmaleens (6) - 2 freq shilliens (6) - 1 freq shillans (7) - 2 freq shilleen (7) - 1 freq shillins (7) - 19 freq halfleens (7) - 1 freq spaelleens (7) - 1 freq shullins (8) - 1 freq halloweens (8) - 2 freq shullans (8) - 1 freq spelleens (8) - 3 freq shameless (8) - 3 freq saileens (8) - 1 freq hulmalees (8) - 1 freq shambles (8) - 30 freq shallis (9) - 1 freq shilling (9) - 4 freq shuillin (9) - 1 freq kellymillen (9) - 1 freq whillans (9) - 1 freq shillin' (9) - 2 freq millans (9) - 1 freq shillan (9) - 1 freq stallions (9) - 1 freq |
SoundEx code - S454 solemnly - 19 freq solemnlute - 1 freq solemly - 2 freq shalmilleens - 1 freq solemn-like - 1 freq shellmaleens - 2 freq |
MetaPhone code - XLMLNS shalmilleens - 1 freq shellmaleens - 2 freq |
SHALMILLEENS |
| Time to execute Levenshtein function - 0.382380 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.469413 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.029299 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.039523 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.001157 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. |