| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vastness (0) - 1 freq sautness (2) - 1 freq daftness (2) - 8 freq aptness (2) - 1 freq justness (2) - 1 freq nastiness (2) - 1 freq pastless (2) - 1 freq saftness (2) - 4 freq fastest (3) - 14 freq caithess (3) - 1 freq maskless (3) - 1 freq badness (3) - 12 freq fitness (3) - 20 freq bassless (3) - 1 freq fawseness (3) - 1 freq aaldness (3) - 1 freq sameness (3) - 1 freq hardness (3) - 1 freq tashless (3) - 3 freq bastes (3) - 4 freq packness (3) - 1 freq vaines (3) - 1 freq actress (3) - 24 freq bisness (3) - 3 freq laziness (3) - 1 freq |
vastness (0) - 1 freq nastiness (3) - 1 freq sautness (3) - 1 freq justness (3) - 1 freq nestiness (4) - 1 freq saftness (4) - 4 freq pastless (4) - 1 freq daftness (4) - 8 freq aptness (4) - 1 freq tasteless (5) - 4 freq hostess (5) - 2 freq deftness (5) - 2 freq wutness (5) - 10 freq maistress (5) - 2 freq mistress (5) - 111 freq quaetness (5) - 1 freq flatness (5) - 1 freq cantiness (5) - 2 freq sadness (5) - 31 freq stress (5) - 41 freq vanessa (5) - 1 freq weetness (5) - 1 freq distress (5) - 11 freq castanets (5) - 7 freq scatness (5) - 2 freq |
SoundEx code - V235 veesitin - 31 freq vexation - 5 freq veisitin - 4 freq victimised - 1 freq victim - 29 freq victims - 10 freq 'visitin - 1 freq veectim - 3 freq vestments - 1 freq veeseeten - 1 freq vacation - 2 freq vocation - 2 freq visitin - 22 freq visiting - 15 freq vestenfraa - 1 freq vastness - 1 freq veectims - 2 freq veictim - 1 freq €”veesitin - 1 freq vkdmxomjbp - 1 freq visitn - 1 freq |
MetaPhone code - FSTNS vastness - 1 freq festoons - 1 freq ghostoons - 1 freq |
VASTNESS |
| Time to execute Levenshtein function - 0.259619 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.437980 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.037751 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.054350 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.000905 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. |