| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| notability (0) - 1 freq stability (2) - 3 freq nobility (2) - 12 freq usability (3) - 1 freq liability (3) - 5 freq disability (3) - 5 freq inability (3) - 6 freq hability (3) - 2 freq probability (3) - 2 freq viability (3) - 1 freq volatility (3) - 1 freq mobility (3) - 6 freq stabeility (3) - 1 freq visability (3) - 2 freq capability (3) - 1 freq notably (3) - 7 freq ability (3) - 44 freq metaility (3) - 1 freq instabeelity (4) - 1 freq negativity (4) - 7 freq immobility (4) - 1 freq mortality (4) - 12 freq veisbility (4) - 1 freq agility (4) - 1 freq nobilitie (4) - 1 freq |
notability (0) - 1 freq nobility (3) - 12 freq stability (3) - 3 freq stabeility (4) - 1 freq notably (4) - 7 freq inability (4) - 6 freq inevitability (5) - 2 freq notable (5) - 5 freq ability (5) - 44 freq metaility (5) - 1 freq nobilitie (5) - 1 freq instabeelity (5) - 1 freq capability (5) - 1 freq stabilitie (5) - 1 freq disability (5) - 5 freq visability (5) - 2 freq usability (5) - 1 freq hability (5) - 2 freq liability (5) - 5 freq viability (5) - 1 freq mobility (5) - 6 freq nativity (6) - 4 freq notoriety (6) - 1 freq noabil (6) - 1 freq affabeility (6) - 1 freq |
SoundEx code - N314 netflix - 16 freq notably - 7 freq 'notable - 1 freq notable - 5 freq needful - 4 freq €˜netflix - 1 freq notability - 1 freq notplanning - 1 freq |
MetaPhone code - NTBLT notability - 1 freq |
NOTABILITY |
| Time to execute Levenshtein function - 0.196052 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.357567 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.027517 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.037185 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.000889 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. |