| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| volumptuous (0) - 1 freq voluptuous (1) - 1 freq sumptuous (3) - 1 freq voluminous (3) - 1 freq contemptuous (4) - 4 freq scrumptious (4) - 3 freq presumptuous (4) - 1 freq gumptious (4) - 1 freq casumptious (4) - 1 freq impetuous (5) - 2 freq columbus (5) - 1 freq evolutions (5) - 1 freq calamitous (5) - 1 freq pompous (5) - 4 freq solicitous (5) - 2 freq volunteers (5) - 19 freq bounteous (5) - 1 freq solutions (5) - 20 freq unctuous (5) - 1 freq virtuous (5) - 3 freq luminous (5) - 5 freq volumes (5) - 16 freq lumpots (5) - 1 freq olympus (5) - 14 freq lustrous (5) - 1 freq |
volumptuous (0) - 1 freq voluptuous (2) - 1 freq voluminous (5) - 1 freq sumptuous (5) - 1 freq casumptious (6) - 1 freq lumpots (6) - 1 freq gumptious (6) - 1 freq volumes (7) - 16 freq calamitous (7) - 1 freq olympus (7) - 14 freq impetuous (7) - 2 freq presumptuous (7) - 1 freq scrumptious (7) - 3 freq contemptuous (7) - 4 freq lumps (8) - 24 freq dolomites (8) - 1 freq flumps (8) - 1 freq limpits (8) - 1 freq clumps (8) - 8 freq slumps (8) - 4 freq volts (8) - 3 freq luminatus (8) - 1 freq limpets (8) - 2 freq olympics (8) - 10 freq blumphs (8) - 3 freq |
SoundEx code - V451 volumptuous - 1 freq valenbisi - 1 freq |
MetaPhone code - FLMPTS volumptuous - 1 freq |
VOLUMPTUOUS |
| Time to execute Levenshtein function - 0.225690 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.411597 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.028530 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.038608 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.000942 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. |