| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nasin (0) - 1 freq casin (1) - 3 freq easin (1) - 11 freq nosin (1) - 2 freq basin (1) - 22 freq nain (1) - 5 freq rasin (1) - 1 freq nashin (1) - 3 freq naein (1) - 1 freq namin (1) - 7 freq yasin (1) - 15 freq haain (2) - 1 freq ladin (2) - 1 freq sin (2) - 676 freq gnawin (2) - 2 freq lavin (2) - 2 freq naim (2) - 5 freq nair (2) - 2 freq causin (2) - 14 freq avin (2) - 2 freq dashin (2) - 7 freq saein (2) - 3 freq busin (2) - 1 freq eisin (2) - 1 freq dalin (2) - 4 freq |
nasin (0) - 1 freq nosin (1) - 2 freq naein (2) - 1 freq namin (2) - 7 freq yasin (2) - 15 freq nashin (2) - 3 freq noisin (2) - 2 freq nosn (2) - 1 freq easin (2) - 11 freq rasin (2) - 1 freq basin (2) - 22 freq nain (2) - 5 freq casin (2) - 3 freq sain (3) - 14 freq reasin (3) - 2 freq nairn (3) - 6 freq notin (3) - 6 freq nash (3) - 2 freq caasin (3) - 3 freq newsin (3) - 29 freq jason (3) - 24 freq nasl (3) - 1 freq asn (3) - 1 freq casino (3) - 9 freq nailin (3) - 1 freq |
SoundEx code - N250 newsin - 29 freq na-sayin - 4 freq noshun - 3 freq noggin - 1 freq noisome - 1 freq nasin - 1 freq naggin - 10 freq nickin - 8 freq neeson - 1 freq newsan - 2 freq nikkin - 1 freq neo-con - 3 freq neocon - 1 freq nahshon - 7 freq nashin - 3 freq nogin - 1 freq naggan - 2 freq nyaagin - 1 freq nickum - 1 freq nignae - 1 freq nosin - 2 freq nyiggin - 1 freq noisin - 2 freq neckin - 3 freq neighin - 1 freq nixon - 8 freq nmcginn - 1 freq nosn - 1 freq nsm - 1 freq nsne - 1 freq nxm - 1 freq nkcuuom - 1 freq nickin - 1 freq nucmw - 1 freq nkmy - 1 freq nscan - 1 freq nxsjm - 1 freq nauseam - 1 freq njoyin - 1 freq |
MetaPhone code - NSN newsin - 29 freq nasin - 1 freq neeson - 1 freq newsan - 2 freq nosin - 2 freq noisin - 2 freq nosn - 1 freq nsne - 1 freq |
NASIN |
| Time to execute Levenshtein function - 0.190687 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.328230 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.028019 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.037898 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.000925 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. |