| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| novena (0) - 1 freq comena (2) - 2 freq niven (2) - 3 freq novels (2) - 29 freq novella (2) - 4 freq dosena (2) - 1 freq nove (2) - 1 freq oven (2) - 51 freq modena (2) - 1 freq nottna (2) - 1 freq coven (2) - 4 freq nova (2) - 7 freq rowena (2) - 1 freq noventae (2) - 1 freq woven (2) - 12 freq oven' (2) - 1 freq havena (2) - 2 freq novel (2) - 65 freq ovens (2) - 4 freq evenan (3) - 2 freq coveran (3) - 2 freq sevens (3) - 3 freq womens (3) - 3 freq oove (3) - 1 freq lovel (3) - 1 freq |
novena (0) - 1 freq niven (2) - 3 freq novel (3) - 65 freq coven (3) - 4 freq nova (3) - 7 freq woven (3) - 12 freq oven (3) - 51 freq nove (3) - 1 freq uneven (3) - 5 freq havena (3) - 2 freq navyne (3) - 3 freq nevin (3) - 1 freq noventae (3) - 1 freq naen (4) - 10 freq hivenae (4) - 1 freq dovin (4) - 2 freq hevna (4) - 8 freq convene (4) - 3 freq govn (4) - 2 freq noon (4) - 29 freq nien (4) - 5 freq davina (4) - 9 freq nosn (4) - 1 freq loveen (4) - 1 freq naver (4) - 3 freq |
SoundEx code - N150 nippin - 31 freq nebbin - 2 freq nippin' - 3 freq nippen - 1 freq nappin - 1 freq novena - 1 freq neibin - 3 freq neebin - 2 freq navyne - 3 freq nippan - 1 freq nuppin - 1 freq nibon - 1 freq nyow-funn - 1 freq nabbin - 2 freq niven - 3 freq n'ben - 1 freq newheiven - 1 freq nfum - 2 freq nvm - 1 freq nevin - 1 freq naefun - 1 freq npn - 1 freq nvmm - 1 freq |
MetaPhone code - NFN novena - 1 freq navyne - 3 freq knifan - 1 freq niven - 3 freq neighin - 1 freq nevin - 1 freq naefun - 1 freq |
NOVENA |
| Time to execute Levenshtein function - 0.207883 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.356375 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.028122 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.039305 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.000913 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. |