| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| novel (0) - 65 freq noel (1) - 1 freq novil (1) - 3 freq nobel (1) - 9 freq hovel (1) - 4 freq navel (1) - 1 freq nove (1) - 1 freq lovel (1) - 1 freq novels (1) - 29 freq covet (2) - 3 freq naval (2) - 8 freq nuvels (2) - 1 freq oven (2) - 51 freq hotel (2) - 99 freq rove (2) - 2 freq never (2) - 1661 freq lovey (2) - 1 freq notes (2) - 117 freq navels (2) - 1 freq woven (2) - 12 freq nevet (2) - 1 freq pavel (2) - 1 freq model (2) - 78 freq goved (2) - 2 freq gavel (2) - 6 freq |
novel (0) - 65 freq navel (1) - 1 freq novil (1) - 3 freq nove (2) - 1 freq lovel (2) - 1 freq naval (2) - 8 freq novels (2) - 29 freq noel (2) - 1 freq hovel (2) - 4 freq nobel (2) - 9 freq nael (3) - 2 freq nool (3) - 1 freq nobil (3) - 1 freq novelty (3) - 9 freq nov (3) - 4 freq novella (3) - 4 freq naver (3) - 3 freq unveil (3) - 1 freq nives (3) - 2 freq novak (3) - 4 freq novelle (3) - 4 freq nol (3) - 1 freq niven (3) - 3 freq niver (3) - 851 freq nigel (3) - 49 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 - 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.289972 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.521908 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.029067 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.067317 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.000911 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. |