| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| voluminous (0) - 1 freq luminous (2) - 5 freq ominous (3) - 6 freq villainous (3) - 1 freq volumptuous (3) - 1 freq voluptuous (3) - 1 freq domino's (4) - 2 freq calamitous (4) - 1 freq evolutions (4) - 1 freq dominus (4) - 2 freq dominoes (4) - 2 freq aluminum (4) - 2 freq solicitous (4) - 2 freq luminatus (4) - 1 freq volcanoes (4) - 19 freq pooshinous (4) - 1 freq aluminium (4) - 7 freq columbus (4) - 1 freq solutions (4) - 20 freq dominos (4) - 5 freq ruinous (4) - 1 freq 'ominous' (4) - 1 freq volumes (4) - 16 freq columns (4) - 9 freq tumorous (5) - 2 freq |
voluminous (0) - 1 freq luminous (3) - 5 freq villainous (4) - 1 freq columns (5) - 9 freq volumes (5) - 16 freq volcanoes (5) - 19 freq evolutions (5) - 1 freq voluptuous (5) - 1 freq volumptuous (5) - 1 freq ominous (5) - 6 freq solutions (6) - 20 freq veillanous (6) - 1 freq vitamins (6) - 3 freq columbus (6) - 1 freq villains (6) - 3 freq solomons (6) - 2 freq loamins (6) - 1 freq dominos (6) - 5 freq aluminum (6) - 2 freq dominoes (6) - 2 freq aluminium (6) - 7 freq dominus (6) - 2 freq luminatus (6) - 1 freq calamitous (6) - 1 freq dolmus (7) - 1 freq |
SoundEx code - V455 voluminous - 1 freq volhynian - 1 freq vuilnuntlq - 1 freq |
MetaPhone code - FLMNS voluminous - 1 freq fleimin's - 1 freq |
VOLUMINOUS |
| Time to execute Levenshtein function - 0.217563 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.384595 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.028625 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.039534 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.000908 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. |