| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| endin (0) - 43 freq sendin (1) - 63 freq endid (1) - 4 freq endan (1) - 2 freq tendin (1) - 9 freq ennin (1) - 2 freq bendin (1) - 15 freq vendin (1) - 2 freq edin (1) - 4 freq lendin (1) - 3 freq mendin (1) - 10 freq endins (1) - 13 freq endit (1) - 55 freq eldin (1) - 3 freq endin' (1) - 1 freq pendin (1) - 3 freq fendin (1) - 5 freq ending (1) - 17 freq enin (1) - 4 freq en'in (1) - 5 freq geldin (2) - 1 freq denyin (2) - 21 freq addin (2) - 39 freq evein (2) - 3 freq bendan (2) - 1 freq |
endin (0) - 43 freq endan (1) - 2 freq needin (2) - 213 freq undain (2) - 1 freq en'in (2) - 5 freq ending (2) - 17 freq enin (2) - 4 freq nedin (2) - 1 freq undoin (2) - 1 freq undon (2) - 1 freq indian (2) - 34 freq unduin (2) - 1 freq pendin (2) - 3 freq endeen (2) - 3 freq fendin (2) - 5 freq bendin (2) - 15 freq vendin (2) - 2 freq ennin (2) - 2 freq tendin (2) - 9 freq sendin (2) - 63 freq endid (2) - 4 freq endin' (2) - 1 freq edin (2) - 4 freq endit (2) - 55 freq eldin (2) - 3 freq |
SoundEx code - E535 endin - 43 freq e'endoun - 2 freq emittin - 1 freq ending - 17 freq entwined - 3 freq entombed - 3 freq emotion - 19 freq emotionally - 5 freq entombs - 1 freq emotions - 32 freq endtimes - 2 freq enatween - 1 freq emotional - 38 freq ent'n - 1 freq endanger - 1 freq endins - 13 freq 'emotional - 1 freq endangered - 6 freq eyntments - 1 freq enythin - 1 freq entangled - 3 freq endan - 2 freq endangered' - 1 freq endeens - 4 freq endeen - 3 freq eontentit - 1 freq eendounlike - 1 freq eendoun - 2 freq endowment - 1 freq endin' - 1 freq endangerit - 1 freq entent - 1 freq eyntment - 2 freq endemic - 3 freq emotionless - 1 freq endonyms - 1 freq endonym - 2 freq |
MetaPhone code - ENTN endin - 43 freq e'endoun - 2 freq ent'n - 1 freq endan - 2 freq endeen - 3 freq eendoun - 2 freq endin' - 1 freq |
ENDIN |
| Time to execute Levenshtein function - 0.209174 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.331089 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.027713 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.037193 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.000877 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. |