| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| endeens (0) - 4 freq endeen (1) - 3 freq enders (2) - 2 freq mendeen (2) - 1 freq endless (2) - 52 freq endins (2) - 13 freq endiess (2) - 2 freq landeens (2) - 1 freq endin (3) - 43 freq 'needs (3) - 1 freq renderins (3) - 3 freq o'deen (3) - 1 freq eydent (3) - 20 freq geens (3) - 1 freq theens (3) - 1 freq biddens (3) - 1 freq deen (3) - 289 freq endliss (3) - 1 freq vikeens (3) - 1 freq enemas (3) - 1 freq readeen (3) - 1 freq middeens (3) - 1 freq extens (3) - 1 freq undies (3) - 3 freq meneins (3) - 1 freq |
endeens (0) - 4 freq endins (2) - 13 freq endeen (2) - 3 freq endiess (3) - 2 freq indians (3) - 11 freq landeens (3) - 1 freq enders (3) - 2 freq ends (4) - 97 freq endures (4) - 3 freq unkens (4) - 1 freq undaen (4) - 1 freq endin' (4) - 1 freq enns (4) - 11 freq ingens (4) - 1 freq anders (4) - 1 freq andean (4) - 1 freq end's (4) - 3 freq lendins (4) - 1 freq undeun (4) - 1 freq endoits (4) - 1 freq dens (4) - 21 freq indies (4) - 6 freq tendons (4) - 1 freq deeins (4) - 7 freq ongaens (4) - 2 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 - ENTNS endins - 13 freq endeens - 4 freq |
ENDEENS |
| Time to execute Levenshtein function - 0.227947 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.669566 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.082063 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.094667 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.000948 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. |