| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neerendin (0) - 1 freq ne'er-endin (2) - 1 freq niverendin (2) - 2 freq never-endin (2) - 2 freq neverending (2) - 1 freq pretendin (3) - 22 freq never-endan (3) - 1 freq never-ending (3) - 2 freq deefenin (3) - 2 freq trendin (3) - 2 freq needin (3) - 213 freq descendin (3) - 11 freq seekenin (3) - 1 freq neeperin (3) - 1 freq extendin (3) - 1 freq leernin (3) - 1 freq brendin (3) - 1 freq neverendum (3) - 1 freq re-readin (3) - 2 freq referencin (3) - 2 freq reedenin (3) - 4 freq dependin (3) - 26 freq niver-endin (3) - 1 freq defendin (3) - 9 freq deepenin (3) - 3 freq |
neerendin (0) - 1 freq niverendin (3) - 2 freq brendin (4) - 1 freq trendin (4) - 2 freq neverending (4) - 1 freq ne'er-endin (4) - 1 freq never-endin (4) - 2 freq dependin (5) - 26 freq niver-endin (5) - 1 freq intendin (5) - 3 freq grundin (5) - 2 freq grindin (5) - 4 freq onendin (5) - 1 freq unendin (5) - 2 freq defendin (5) - 9 freq neverendum (5) - 1 freq never-endan (5) - 1 freq brendan (5) - 5 freq needin (5) - 213 freq leernin (5) - 1 freq extendin (5) - 1 freq brandin (5) - 1 freq pretendin (5) - 22 freq herdin (6) - 15 freq 'reddin (6) - 1 freq |
SoundEx code - N653 nearhaund - 16 freq neerendin - 1 freq nearhaunthat's - 1 freq ne'er-endin - 1 freq neirhaund - 1 freq naurhaund - 1 freq narhaund - 1 freq nearhand - 2 freq normative - 1 freq €˜naurhaund - 1 freq |
MetaPhone code - NRNTN neerendin - 1 freq ne'er-endin - 1 freq |
NEERENDIN |
| Time to execute Levenshtein function - 0.250616 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.579026 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.028110 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.052432 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.000912 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. |