| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nectar (0) - 9 freq nestan (2) - 1 freq lectur (2) - 2 freq hector (2) - 13 freq neymar (2) - 1 freq gectaar (2) - 1 freq netta (2) - 6 freq nevar (2) - 1 freq rector (2) - 3 freq pentar (2) - 1 freq neuter (2) - 2 freq nechtan (2) - 1 freq tertar (2) - 2 freq pectae (2) - 1 freq ncar (2) - 1 freq nucear (2) - 1 freq sector (2) - 101 freq netter (2) - 6 freq near (2) - 1167 freq notar (2) - 2 freq nmckay (3) - 1 freq neebor (3) - 43 freq leathr (3) - 1 freq newts (3) - 1 freq penter (3) - 5 freq |
nectar (0) - 9 freq ncar (3) - 1 freq neuter (3) - 2 freq nucear (3) - 1 freq sector (3) - 101 freq notar (3) - 2 freq rector (3) - 3 freq netter (3) - 6 freq lectur (3) - 2 freq hector (3) - 13 freq gectaar (3) - 1 freq lectra (4) - 7 freq nicer (4) - 6 freq enter (4) - 72 freq negator (4) - 6 freq ncher (4) - 1 freq notare (4) - 1 freq naetir (4) - 1 freq nayter (4) - 2 freq nicher (4) - 5 freq factor (4) - 31 freq picter (4) - 88 freq elector (4) - 2 freq nattur (4) - 1 freq nifter (4) - 2 freq |
SoundEx code - N236 nocturne's - 1 freq nostrils - 20 freq nicht-air - 5 freq nosethirles - 1 freq nocturnal - 3 freq next-door - 2 freq nectar - 9 freq nostradamus - 2 freq neestdoor - 1 freq nastier - 1 freq nocturne - 2 freq nixtdoor - 1 freq nixt-dorr - 1 freq nasturtiums - 2 freq neesteran - 1 freq nightdress - 1 freq naist-door's - 1 freq negator - 6 freq nictheárlaich - 1 freq neist-door - 1 freq nicht-work - 1 freq nostre - 1 freq nostril - 1 freq nostril-flarin - 1 freq nicktroyftof - 2 freq nuxtarn - 1 freq nqtdrtgeqz - 1 freq |
MetaPhone code - NKTR nectar - 9 freq negator - 6 freq |
NECTAR |
| Time to execute Levenshtein function - 0.223360 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.427650 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.027534 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.037721 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.000978 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. |