| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| voluble (0) - 1 freq vocable (2) - 1 freq veluable (2) - 3 freq rouble (2) - 7 freq volume (2) - 33 freq double (2) - 129 freq valuable (2) - 18 freq module (3) - 9 freq visible (3) - 25 freq doubled (3) - 7 freq insoluble (3) - 1 freq volley (3) - 9 freq value (3) - 65 freq cobble (3) - 5 freq columbae (3) - 2 freq doublt (3) - 2 freq bauble (3) - 5 freq 'double (3) - 3 freq trouble (3) - 192 freq vouels (3) - 1 freq hourle (3) - 1 freq doubler (3) - 6 freq volce (3) - 1 freq doule (3) - 2 freq boule (3) - 3 freq |
voluble (0) - 1 freq veluable (2) - 3 freq valuable (2) - 18 freq vailuable (3) - 4 freq vocable (3) - 1 freq viable (4) - 11 freq visable (4) - 1 freq available (4) - 128 freq ville (4) - 1 freq valuables (4) - 3 freq voll (4) - 1 freq avaelable (4) - 2 freq double (4) - 129 freq volume (4) - 33 freq rouble (4) - 7 freq volley (4) - 9 freq visible (4) - 25 freq volatile (4) - 3 freq gobble (5) - 3 freq volum (5) - 1 freq doubly (5) - 4 freq coble (5) - 5 freq tholable (5) - 1 freq vouel (5) - 2 freq lube (5) - 1 freq |
SoundEx code - V414 vailuable - 4 freq valuables - 3 freq v-l-v-l-veeee - 1 freq voluble - 1 freq valuable - 18 freq veluable - 3 freq valpolicella - 1 freq valleyfield - 1 freq |
MetaPhone code - FLBL vailuable - 4 freq voluble - 1 freq valuable - 18 freq veluable - 3 freq |
VOLUBLE |
| Time to execute Levenshtein function - 0.196437 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.359293 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.027041 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.037390 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.000877 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. |