| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vulnerable (0) - 19 freq venerable (2) - 1 freq 'vulnerable' (2) - 1 freq tolerable (3) - 1 freq answerable (4) - 2 freq believable (4) - 3 freq 'unable (4) - 1 freq unviable (4) - 1 freq unable (4) - 19 freq unstable (4) - 1 freq miserable (4) - 56 freq funeral (4) - 81 freq funeral' (4) - 1 freq mïserable (4) - 1 freq mainnerable (4) - 1 freq reperable (4) - 1 freq culpable (4) - 2 freq meeserable (4) - 6 freq lunchable (4) - 1 freq vulnerability (4) - 3 freq vegetable (4) - 15 freq valuable (4) - 18 freq malleable (4) - 2 freq renewable (4) - 2 freq unbearable (4) - 2 freq |
vulnerable (0) - 19 freq venerable (3) - 1 freq 'vulnerable' (4) - 1 freq vulnerability (5) - 3 freq tolerable (5) - 1 freq mainnerable (6) - 1 freq veluable (6) - 3 freq valuable (6) - 18 freq meiserable (7) - 1 freq honourable (7) - 8 freq malleable (7) - 2 freq preferable (7) - 2 freq unbearable (7) - 2 freq inalienable (7) - 1 freq voluble (7) - 1 freq vulnerabilities (7) - 1 freq variable (7) - 5 freq vailuable (7) - 4 freq vulgarly (7) - 1 freq avaelable (7) - 2 freq turntable (7) - 1 freq renewable (7) - 2 freq unviable (7) - 1 freq 'unable (7) - 1 freq unable (7) - 19 freq |
SoundEx code - V456 vulnerabeelities - 1 freq vulnerable - 19 freq vulnerabilities - 1 freq 'vulnerable' - 1 freq vulnerability - 3 freq |
MetaPhone code - FLNRBL vulnerable - 19 freq 'vulnerable' - 1 freq |
VULNERABLE |
| Time to execute Levenshtein function - 0.199942 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.384704 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.026946 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.036927 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.000797 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. |