| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nuptial (0) - 8 freq 'nuptial (1) - 1 freq nuptials (1) - 1 freq uptill (2) - 1 freq neutral (3) - 17 freq gupta (3) - 1 freq optimal (3) - 1 freq uphill (3) - 3 freq yuptae (3) - 4 freq suttil (3) - 1 freq naitral (3) - 37 freq turtil (3) - 1 freq numptics (3) - 1 freq uptap (3) - 1 freq futbal (3) - 1 freq nuppin (3) - 1 freq nuttall (3) - 1 freq nepal (3) - 1 freq sundial (3) - 1 freq uptak (3) - 14 freq naetral (3) - 1 freq initial (3) - 18 freq quetzal (3) - 1 freq uptae (3) - 22 freq partial (3) - 8 freq |
nuptial (0) - 8 freq nuptials (2) - 1 freq 'nuptial (2) - 1 freq until (4) - 495 freq ineetial (4) - 1 freq uptail (4) - 2 freq initial (4) - 18 freq natal (4) - 2 freq nepal (4) - 1 freq uptill (4) - 1 freq septile (5) - 5 freq martial (5) - 5 freq bestial (5) - 1 freq nial (5) - 4 freq mutual (5) - 27 freq ental (5) - 1 freq instil (5) - 1 freq numptie (5) - 9 freq phial (5) - 1 freq neptune (5) - 19 freq nept (5) - 1 freq capital (5) - 90 freq nestily (5) - 1 freq ospital (5) - 8 freq naphtali (5) - 4 freq |
SoundEx code - N134 naebdy'll - 2 freq naebody'll - 6 freq nuptial - 8 freq newbattle - 8 freq naphtali - 4 freq 'nuptial - 1 freq nuptials - 1 freq |
MetaPhone code - NPXL nuptial - 8 freq 'nuptial - 1 freq |
NUPTIAL |
| Time to execute Levenshtein function - 0.178137 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.353001 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.027556 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.036926 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.000918 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. |