| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| navel (0) - 1 freq nave (1) - 1 freq novel (1) - 65 freq gavel (1) - 6 freq navels (1) - 1 freq naver (1) - 3 freq nael (1) - 2 freq ravel (1) - 2 freq pavel (1) - 1 freq naval (1) - 8 freq gave (2) - 237 freq lapel (2) - 3 freq nove (2) - 1 freq davey (2) - 13 freq avec (2) - 1 freq lavey (2) - 2 freq naze (2) - 1 freq casel (2) - 1 freq name' (2) - 3 freq nal (2) - 1 freq lael (2) - 6 freq marvel (2) - 6 freq never (2) - 1611 freq maves (2) - 8 freq rave (2) - 9 freq |
navel (0) - 1 freq naval (1) - 8 freq novel (1) - 65 freq pavel (2) - 1 freq nael (2) - 2 freq novil (2) - 3 freq ravel (2) - 2 freq nave (2) - 1 freq gavel (2) - 6 freq navels (2) - 1 freq naver (2) - 3 freq nigel (3) - 49 freq nately (3) - 2 freq anvil (3) - 5 freq enamel (3) - 5 freq niel (3) - 1 freq niven (3) - 3 freq yaval (3) - 1 freq nives (3) - 2 freq noel (3) - 1 freq unravel (3) - 1 freq level (3) - 146 freq navir (3) - 2 freq nasl (3) - 1 freq lovel (3) - 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 |
NAVEL |
| Time to execute Levenshtein function - 0.224653 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.414139 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.029964 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.049503 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.000903 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. |