| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| navyne (0) - 3 freq abyne (2) - 2 freq nyne (2) - 4 freq nane (2) - 547 freq avyse (2) - 4 freq navy (2) - 45 freq nayme (2) - 2 freq ayne (2) - 3 freq jayne (2) - 2 freq wayne (2) - 6 freq nairne (2) - 3 freq nave (2) - 1 freq payne (2) - 18 freq carynx (3) - 1 freq native (3) - 94 freq malone (3) - 4 freq pavvie (3) - 2 freq naggie (3) - 2 freq naigie (3) - 1 freq canine (3) - 3 freq maine (3) - 1 freq navdeep (3) - 14 freq pyne (3) - 25 freq famine (3) - 15 freq nav (3) - 3 freq |
navyne (0) - 3 freq niven (3) - 3 freq novena (3) - 1 freq nevin (3) - 1 freq nairne (3) - 3 freq nave (3) - 1 freq nyne (3) - 4 freq nane (3) - 547 freq navy (3) - 45 freq avenue (4) - 19 freq naeyin (4) - 2 freq caven (4) - 1 freq naan (4) - 2 freq navies (4) - 1 freq nanna (4) - 1 freq na-na (4) - 1 freq inane (4) - 2 freq havn (4) - 2 freq lavin (4) - 2 freq devine (4) - 3 freq naein (4) - 1 freq navefu (4) - 1 freq havena (4) - 2 freq cavan (4) - 1 freq nasin (4) - 1 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 |
NAVYNE |
| Time to execute Levenshtein function - 0.206548 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.354605 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.028970 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.037509 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.000870 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. |