| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nyaffs (0) - 6 freq gnyaffs (1) - 1 freq nyaff (1) - 24 freq yaffs (1) - 1 freq nyargs (2) - 1 freq graffs (2) - 2 freq naff (2) - 2 freq scaffs (2) - 1 freq waffs (2) - 7 freq daffs (2) - 3 freq naffu (2) - 1 freq staffs (2) - 1 freq nyatf (2) - 1 freq gaffs (2) - 4 freq affs (2) - 4 freq nyaaf (2) - 2 freq caffe (3) - 1 freq oaffy (3) - 3 freq yasss (3) - 1 freq noads (3) - 1 freq baffy (3) - 3 freq yaes (3) - 16 freq scuffs (3) - 1 freq datfs (3) - 1 freq nffc (3) - 1 freq |
nyaffs (0) - 6 freq nyaff (2) - 24 freq yaffs (2) - 1 freq gnyaffs (2) - 1 freq daffs (3) - 3 freq naffu (3) - 1 freq affs (3) - 4 freq waffs (3) - 7 freq gaffs (3) - 4 freq naff (3) - 2 freq guffs (4) - 4 freq cuffs (4) - 7 freq niff (4) - 1 freq toffs (4) - 13 freq daffys (4) - 1 freq nyfe's (4) - 1 freq buffs (4) - 4 freq houffs (4) - 1 freq ruffs (4) - 1 freq coffs (4) - 2 freq doffs (4) - 1 freq wyiffis (4) - 1 freq huffs (4) - 2 freq offs (4) - 9 freq ffs (4) - 152 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 - NYFS nyaffs - 6 freq gnyaffs - 1 freq |
NYAFFS |
| Time to execute Levenshtein function - 0.184072 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.344852 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.029755 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.038391 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.000814 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. |