| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neckline (0) - 1 freq decline (2) - 21 freq recline (2) - 2 freq neckin (2) - 3 freq kecklin (2) - 11 freq hecklin (2) - 1 freq tecklin (2) - 1 freq necktie (2) - 1 freq fecklie (2) - 2 freq necklace (2) - 28 freq kecksie (3) - 1 freq tacklin (3) - 4 freq backlins (3) - 18 freq feckin (3) - 51 freq nestlin (3) - 2 freq nellie (3) - 42 freq seiklie (3) - 1 freq heidline (3) - 13 freq deidline (3) - 1 freq recliner (3) - 2 freq nicotine (3) - 7 freq derklie (3) - 1 freq peckin' (3) - 3 freq necklaces (3) - 3 freq cacklin (3) - 2 freq |
neckline (0) - 1 freq tecklin (3) - 1 freq necklace (3) - 28 freq kecklin (3) - 11 freq hecklin (3) - 1 freq neckin (3) - 3 freq ticklin (4) - 6 freq knucklin (4) - 1 freq bucklin (4) - 7 freq hucklin (4) - 2 freq cacklin (4) - 2 freq racklin (4) - 3 freq picklin (4) - 2 freq sucklin (4) - 1 freq incline (4) - 7 freq nickin (4) - 8 freq recline (4) - 2 freq tacklin (4) - 4 freq fecklie (4) - 2 freq necktie (4) - 1 freq decline (4) - 21 freq heckle (5) - 2 freq inclin (5) - 1 freq macklike (5) - 1 freq wrackline (5) - 1 freq |
SoundEx code - N245 nuzzlin - 1 freq nigglin - 3 freq niggling - 1 freq neckline - 1 freq newzealand - 1 freq nicolamcalley - 1 freq niocalmccormaig - 1 freq naecoolmin - 1 freq |
MetaPhone code - NKLN knucklin - 1 freq nigglin - 3 freq neckline - 1 freq |
NECKLINE |
| Time to execute Levenshtein function - 0.312601 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.578585 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.081226 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.038365 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.001110 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. |