| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neville (0) - 14 freq seville (1) - 1 freq annville (2) - 1 freq evill (2) - 1 freq melville (2) - 1 freq neill (2) - 17 freq ville (2) - 1 freq reveille (2) - 1 freq neilly (2) - 12 freq revile (2) - 3 freq novelle (2) - 4 freq saville (2) - 5 freq newtyle (3) - 2 freq novil (3) - 3 freq senile (3) - 1 freq neige (3) - 2 freq nettle (3) - 8 freq revell (3) - 1 freq movilla (3) - 3 freq villa (3) - 7 freq eivill (3) - 1 freq nevin (3) - 1 freq levite (3) - 2 freq nefife (3) - 1 freq reilly (3) - 3 freq |
neville (0) - 14 freq novelle (2) - 4 freq seville (2) - 1 freq neilly (3) - 12 freq annville (3) - 1 freq reveille (3) - 1 freq novella (3) - 4 freq saville (3) - 5 freq ville (3) - 1 freq evill (3) - 1 freq neill (3) - 17 freq oneill (4) - 2 freq nell (4) - 13 freq ceevilly (4) - 5 freq nellie (4) - 42 freq eeevilly (4) - 1 freq newall (4) - 1 freq nobill (4) - 1 freq nilly (4) - 1 freq novils (4) - 1 freq nelly (4) - 8 freq devaill (4) - 1 freq villee (4) - 1 freq eivill (4) - 1 freq melville (4) - 1 freq |
SoundEx code - N140 noble - 30 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 - NFL novel - 65 freq naval - 8 freq neville - 14 freq novelle - 4 freq novella - 4 freq naafil - 1 freq navel - 1 freq novil - 3 freq nfl - 2 freq |
NEVILLE |
| Time to execute Levenshtein function - 0.180706 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.334091 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.027453 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.037132 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.000874 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. |