| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| novel (0) - 65 freq nobel (1) - 9 freq navel (1) - 1 freq novels (1) - 29 freq noel (1) - 1 freq nove (1) - 1 freq hovel (1) - 4 freq lovel (1) - 1 freq novil (1) - 3 freq naval (2) - 8 freq nova (2) - 7 freq niver (2) - 849 freq nael (2) - 2 freq toved (2) - 1 freq noked (2) - 1 freq rover (2) - 12 freq noses (2) - 20 freq bowel (2) - 16 freq joves (2) - 2 freq oven (2) - 51 freq dover (2) - 15 freq sobel (2) - 1 freq move (2) - 307 freq pavel (2) - 1 freq nave (2) - 1 freq |
novel (0) - 65 freq novil (1) - 3 freq navel (1) - 1 freq lovel (2) - 1 freq hovel (2) - 4 freq naval (2) - 8 freq nove (2) - 1 freq nobel (2) - 9 freq novels (2) - 29 freq noel (2) - 1 freq ravel (3) - 2 freq naver (3) - 3 freq nobil (3) - 1 freq novelle (3) - 4 freq navels (3) - 1 freq nuvels (3) - 1 freq novella (3) - 4 freq level (3) - 146 freq nov (3) - 4 freq oval (3) - 7 freq lovely (3) - 162 freq novak (3) - 4 freq nigel (3) - 49 freq unveil (3) - 1 freq nol (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 |
NOVEL |
| Time to execute Levenshtein function - 0.195565 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.340769 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.027755 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.037278 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.000815 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. |