| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| luminous (0) - 5 freq ominous (2) - 6 freq luminatus (2) - 1 freq voluminous (2) - 1 freq ruinous (2) - 1 freq numerous (3) - 8 freq dominos (3) - 5 freq dominoes (3) - 2 freq dubious (3) - 3 freq lupins (3) - 3 freq tumorous (3) - 2 freq luingis (3) - 1 freq quintus (3) - 1 freq eumenius (3) - 1 freq lustrous (3) - 1 freq curious (3) - 74 freq dominus (3) - 2 freq lamingoes (3) - 1 freq luminate (3) - 1 freq luscious (3) - 1 freq aluminum (3) - 2 freq 'ominous' (3) - 1 freq minors (3) - 1 freq lino's (3) - 1 freq mingus (3) - 1 freq |
luminous (0) - 5 freq ominous (3) - 6 freq voluminous (3) - 1 freq luminatus (3) - 1 freq aluminum (4) - 2 freq luminate (4) - 1 freq dominus (4) - 2 freq linus (4) - 1 freq lamingoes (4) - 1 freq minos (4) - 6 freq lemons (4) - 2 freq lemans (4) - 1 freq loamins (4) - 1 freq aluminium (4) - 7 freq minus (4) - 5 freq dominos (4) - 5 freq lupins (4) - 3 freq ruinous (4) - 1 freq dominoes (4) - 2 freq eumenius (4) - 1 freq lumen (5) - 1 freq likins (5) - 1 freq 'mines (5) - 1 freq lumms (5) - 1 freq humans (5) - 53 freq |
SoundEx code - L552 lanmines - 1 freq lamingoes - 1 freq lining - 1 freq leniency - 1 freq loanins - 7 freq loaningfoot - 1 freq loaningfit - 2 freq leaning - 5 freq lemon-juice - 1 freq linins - 1 freq lemons - 2 freq luminous - 5 freq loanens - 4 freq looming - 3 freq linings - 2 freq lemans - 1 freq linens - 1 freq limnins - 1 freq loamins - 1 freq lanyon's - 1 freq leninst - 1 freq leanins - 1 freq limeayoungjohnny - 1 freq liamyoung - 1 freq linins - 2 freq leamington - 1 freq |
MetaPhone code - LMNS lemons - 2 freq luminous - 5 freq lemans - 1 freq loamins - 1 freq lambeens - 2 freq |
LUMINOUS |
| Time to execute Levenshtein function - 0.234350 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.365641 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.027351 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.037182 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.000857 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. |