| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| notable (0) - 5 freq 'notable (1) - 1 freq notably (1) - 6 freq i'table (2) - 1 freq stable (2) - 69 freq notae (2) - 1 freq noticable (2) - 1 freq sitable (2) - 2 freq notare (2) - 1 freq vocable (2) - 1 freq natale (2) - 1 freq noble (2) - 30 freq table (2) - 674 freq portable (2) - 9 freq unstable (2) - 1 freq totally (3) - 117 freq gobble (3) - 3 freq botabit (3) - 1 freq tale (3) - 299 freq unmutable (3) - 1 freq moveable (3) - 1 freq tanle (3) - 1 freq table' (3) - 1 freq noarbie (3) - 2 freq enable (3) - 4 freq |
notable (0) - 5 freq notably (1) - 6 freq 'notable (2) - 1 freq noble (3) - 30 freq table (3) - 674 freq sitable (3) - 2 freq unstable (3) - 1 freq natale (3) - 1 freq i'table (3) - 1 freq noticable (3) - 1 freq stable (3) - 69 freq natal (4) - 2 freq unable (4) - 19 freq noticeable (4) - 2 freq enviable (4) - 1 freq suitable (4) - 13 freq taible (4) - 2 freq noabil (4) - 1 freq nimble (4) - 1 freq nibble (4) - 8 freq enable (4) - 4 freq taeble (4) - 3 freq portable (4) - 9 freq nettle (4) - 8 freq vocable (4) - 1 freq |
SoundEx code - N314 netflix - 16 freq notably - 6 freq 'notable - 1 freq notable - 5 freq needful - 4 freq €˜netflix - 1 freq notability - 1 freq notplanning - 1 freq |
MetaPhone code - NTBL notably - 6 freq 'notable - 1 freq notable - 5 freq |
NOTABLE |
| Time to execute Levenshtein function - 0.186081 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.354082 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.026986 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.036824 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.000830 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. |