| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| noble (0) - 32 freq 'noble (1) - 1 freq coble (1) - 5 freq nobles (1) - 7 freq noose (2) - 15 freq nope (2) - 18 freq robe (2) - 5 freq no'ye (2) - 1 freq mole (2) - 11 freq nobill (2) - 1 freq yable (2) - 7 freq nol (2) - 1 freq fobie (2) - 32 freq nobel (2) - 9 freq oboe (2) - 1 freq gobble (2) - 3 freq nobs (2) - 3 freq double (2) - 129 freq nle (2) - 1 freq gable (2) - 8 freq mobile (2) - 57 freq rouble (2) - 7 freq -able (2) - 1 freq hoyle (2) - 3 freq pole (2) - 45 freq |
noble (0) - 32 freq 'noble (2) - 1 freq nobil (2) - 1 freq enable (2) - 4 freq nobel (2) - 9 freq coble (2) - 5 freq nobles (2) - 7 freq unable (2) - 19 freq dooble (3) - 26 freq nile (3) - 14 freq amble (3) - 3 freq table (3) - 686 freq noodle (3) - 7 freq inablo (3) - 5 freq boule (3) - 3 freq bible (3) - 95 freq cable (3) - 12 freq neale (3) - 1 freq bole (3) - 4 freq aible (3) - 2 freq mable (3) - 2 freq notable (3) - 5 freq able (3) - 436 freq sable (3) - 2 freq anbile (3) - 1 freq |
SoundEx code - N140 noble - 32 freq nibble - 8 freq nipple - 3 freq novel - 65 freq naval - 8 freq neville - 14 freq nippily - 2 freq 'noble - 1 freq 'nobel - 1 freq nobel - 9 freq novelle - 4 freq noabil - 1 freq novella - 4 freq nobil - 1 freq nobill - 1 freq naafil - 1 freq navel - 1 freq €˜noble - 1 freq nepal - 1 freq novil - 3 freq nfl - 2 freq nebbiolo - 1 freq |
MetaPhone code - NBL noble - 32 freq nibble - 8 freq knobbly - 5 freq 'noble - 1 freq 'nobel - 1 freq nobel - 9 freq noabil - 1 freq nobil - 1 freq nobill - 1 freq knobble - 4 freq €˜noble - 1 freq nebbiolo - 1 freq |
NOBLE |
| Time to execute Levenshtein function - 0.180472 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.356589 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.028350 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.037044 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.000908 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. |