| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| linoleum (0) - 11 freq ileum (3) - 1 freq lineup (3) - 1 freq tinklers (4) - 2 freq liklee (4) - 1 freq ingle (4) - 29 freq injum (4) - 1 freq lingers (4) - 6 freq liddle (4) - 1 freq linus (4) - 1 freq lined-up (4) - 1 freq ringle (4) - 1 freq lingua (4) - 10 freq timorsum (4) - 1 freq signorum (4) - 1 freq violent (4) - 18 freq involed (4) - 1 freq tingle (4) - 4 freq collum (4) - 1 freq kindlers (4) - 1 freq linker (4) - 1 freq winkled (4) - 1 freq lifeless (4) - 7 freq violet (4) - 316 freq hin-legs (4) - 2 freq |
linoleum (0) - 11 freq ileum (5) - 1 freq lanley (5) - 1 freq lanesum (5) - 5 freq lionel (5) - 2 freq lineup (5) - 1 freq linjm (5) - 1 freq line' (6) - 3 freq linen (6) - 26 freq lanelie (6) - 1 freq willum (6) - 5 freq lanlady (6) - 5 freq lousum (6) - 2 freq nondum (6) - 1 freq i'lum (6) - 1 freq lined (6) - 48 freq liners (6) - 2 freq volum (6) - 1 freq linnean (6) - 1 freq lnm (6) - 1 freq landles (6) - 2 freq line's (6) - 2 freq liable (6) - 4 freq lintel (6) - 6 freq libdem (6) - 2 freq |
SoundEx code - L545 loneliness - 5 freq linoleum - 11 freq laneliness - 1 freq linoleum-clad - 1 freq €™loneliness - 1 freq lamland - 1 freq |
MetaPhone code - LNLM linoleum - 11 freq |
LINOLEUM |
| Time to execute Levenshtein function - 0.206409 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.367156 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.030398 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.039760 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.000964 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. |