| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nceded (0) - 1 freq needed (1) - 150 freq ceded (1) - 1 freq neded (1) - 3 freq nodded (2) - 71 freq nedes (2) - 2 freq receded (2) - 1 freq heeded (2) - 14 freq weeded (2) - 1 freq leeded (2) - 1 freq needet (2) - 2 freq nede (2) - 3 freq needid (2) - 1 freq cede (2) - 1 freq need (2) - 1819 freq coded (2) - 2 freq seeded (2) - 3 freq naemed (2) - 1 freq conceded (2) - 4 freq meeded (2) - 1 freq heded (2) - 1 freq needen (2) - 3 freq scoped (3) - 1 freq inched (3) - 3 freq cried (3) - 983 freq |
nceded (0) - 1 freq needed (2) - 150 freq neded (2) - 3 freq ceded (2) - 1 freq coded (3) - 2 freq conceded (3) - 4 freq needid (3) - 1 freq receded (3) - 1 freq nodded (3) - 71 freq eynded (4) - 1 freq decided (4) - 210 freq ended (4) - 72 freq anced (4) - 1 freq noadded (4) - 2 freq included (4) - 19 freq facedd (4) - 1 freq indeed (4) - 178 freq codd (4) - 7 freq nocked (4) - 1 freq encased (4) - 2 freq unheeded (4) - 1 freq nicked (4) - 14 freq decoded (4) - 1 freq uncried (4) - 1 freq inded (4) - 1 freq |
SoundEx code - N233 negotiates - 1 freq nceded - 1 freq nestit - 3 freq nicht-watchie - 1 freq negotiate - 6 freq negotiations - 6 freq negotiated - 2 freq nested - 1 freq nyght'at - 1 freq negated - 2 freq noosted - 1 freq nicht-at-eenie - 2 freq new-cutted - 2 freq nochtwithstaundin - 1 freq negotiatit - 2 freq negotiation - 1 freq nicht-it - 1 freq negotioations - 1 freq €˜negotiations - 1 freq negotiatin - 2 freq negatit - 1 freq newstatesman - 4 freq negotiators - 1 freq nesstotties - 1 freq |
MetaPhone code - NSTT nceded - 1 freq nestit - 3 freq nested - 1 freq noosted - 1 freq |
NCEDED |
| Time to execute Levenshtein function - 0.363651 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.467216 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.031633 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.044405 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.000901 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. |