| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| novelty (0) - 9 freq novelle (2) - 4 freq lovely (2) - 162 freq novels (2) - 29 freq novel (2) - 65 freq novella (2) - 4 freq poverty (2) - 37 freq overty (2) - 1 freq navel (3) - 1 freq novelists (3) - 8 freq mosely (3) - 2 freq nove (3) - 1 freq lovel (3) - 1 freq covet (3) - 3 freq overly (3) - 6 freq novelist (3) - 4 freq hovels (3) - 1 freq coverts (3) - 1 freq namely (3) - 10 freq lively (3) - 10 freq covert (3) - 38 freq nelly (3) - 8 freq noel (3) - 1 freq comely (3) - 4 freq nicely (3) - 16 freq |
novelty (0) - 9 freq novella (3) - 4 freq novels (3) - 29 freq novel (3) - 65 freq novelle (3) - 4 freq novil (4) - 3 freq levelt (4) - 1 freq novelist (4) - 4 freq novils (4) - 1 freq nuvels (4) - 1 freq ravelt (4) - 1 freq nolte (4) - 1 freq nobility (4) - 11 freq noventae (4) - 1 freq overty (4) - 1 freq poverty (4) - 37 freq lovely (4) - 162 freq navel (4) - 1 freq nolt (4) - 1 freq navels (4) - 1 freq nevet (4) - 1 freq syventy (5) - 2 freq inveit (5) - 5 freq nvt (5) - 1 freq nately (5) - 2 freq |
SoundEx code - N143 nibbled - 8 freq nibblt - 1 freq nibbelt - 2 freq nobilities - 1 freq novelty - 9 freq nobilitie - 1 freq nuffield - 3 freq nobility - 11 freq €œnew-build - 1 freq new-fillt - 1 freq nflwd - 1 freq nafvhltkxv - 1 freq napulitano - 1 freq nibbledbyducks - 1 freq |
MetaPhone code - NFLT novelty - 9 freq nuffield - 3 freq new-fillt - 1 freq nflwd - 1 freq |
NOVELTY |
| Time to execute Levenshtein function - 0.210339 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.374683 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.028271 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.038462 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.001052 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. |