| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| novak (0) - 4 freq noak (1) - 3 freq nova (1) - 7 freq rova (2) - 1 freq notae (2) - 1 freq noad (2) - 11 freq rovan (2) - 1 freq soak (2) - 15 freq noas (2) - 2 freq slovak (2) - 6 freq lovan (2) - 3 freq roak (2) - 12 freq nava (2) - 30 freq nora (2) - 6 freq govan (2) - 10 freq nook (2) - 7 freq nove (2) - 1 freq hoak (2) - 5 freq nevar (2) - 1 freq soeak (2) - 1 freq nock (2) - 14 freq loak (2) - 1 freq notar (2) - 2 freq nva (2) - 2 freq nak (2) - 1 freq |
novak (0) - 4 freq nova (2) - 7 freq noak (2) - 3 freq novil (3) - 3 freq nove (3) - 1 freq nook (3) - 7 freq nevar (3) - 1 freq nva (3) - 2 freq nak (3) - 1 freq naval (3) - 8 freq nok (3) - 4 freq nock (3) - 14 freq nava (3) - 30 freq anorak (3) - 11 freq novel (3) - 65 freq nov (3) - 4 freq neek (4) - 1 freq nokia (4) - 2 freq intak (4) - 2 freq nave (4) - 1 freq nevur (4) - 1 freq nvm (4) - 1 freq nk (4) - 3 freq nwk (4) - 1 freq nek (4) - 2 freq |
SoundEx code - N120 neeps - 148 freq nieves - 15 freq nebs - 41 freq nips - 27 freq naps - 2 freq neives - 10 freq nephews - 6 freq nappies - 9 freq neebs - 13 freq nevis - 4 freq nephew's - 2 freq novice - 5 freq navajo - 1 freq neep's - 3 freq nyfe's - 1 freq neeps' - 1 freq 'nephews' - 1 freq nyaffs - 6 freq nives - 2 freq nobs - 3 freq neb's - 4 freq novak - 4 freq newbies - 1 freq nbs - 1 freq naevius - 1 freq navies - 1 freq nibbies - 1 freq noviss - 1 freq nopiece - 2 freq nvq - 6 freq nippies - 3 freq nava's - 2 freq naips - 1 freq nubuck - 1 freq nvch - 1 freq nfxo - 1 freq nufc - 6 freq niviews - 1 freq nbshow - 10 freq nobxzz - 1 freq nfywssqz - 1 freq npq - 1 freq nops - 1 freq nfias - 1 freq npx - 1 freq nebs' - 1 freq nivg - 1 freq nffc - 1 freq |
MetaPhone code - NFK novak - 4 freq nvq - 6 freq nufc - 6 freq nivg - 1 freq nffc - 1 freq |
NOVAK |
| Time to execute Levenshtein function - 0.237759 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.491646 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.039546 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.041552 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.000983 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. |