| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| entent (0) - 1 freq entert (1) - 7 freq extent (1) - 47 freq intent (1) - 37 freq etten (2) - 35 freq stent (2) - 29 freq extens (2) - 1 freq intend (2) - 10 freq extend (2) - 9 freq attent (2) - 1 freq patent (2) - 39 freq entreat (2) - 2 freq eydent (2) - 17 freq 'stent (2) - 1 freq intents (2) - 2 freq intert (2) - 1 freq festent (2) - 1 freq tenent (2) - 2 freq endet (2) - 42 freq potent (2) - 6 freq enters (2) - 10 freq ettelt (2) - 13 freq fentest (2) - 1 freq anent (2) - 516 freq tent (2) - 458 freq |
entent (0) - 1 freq intent (1) - 37 freq untenty (2) - 1 freq extent (2) - 47 freq entert (2) - 7 freq untelt (3) - 2 freq sentient (3) - 1 freq inten (3) - 2 freq extint (3) - 1 freq tent (3) - 458 freq eyntment (3) - 2 freq content (3) - 117 freq enterit (3) - 2 freq invent (3) - 11 freq untentie (3) - 2 freq extant (3) - 9 freq onkent (3) - 2 freq anent (3) - 516 freq intonit (3) - 1 freq unkent (3) - 50 freq entreat (3) - 2 freq intents (3) - 2 freq stent (3) - 29 freq attent (3) - 1 freq intend (3) - 10 freq |
SoundEx code - E535 endin - 43 freq e'endoun - 2 freq emittin - 1 freq ending - 17 freq entwined - 3 freq entombed - 3 freq emotion - 18 freq emotionally - 5 freq entombs - 1 freq emotions - 31 freq endtimes - 2 freq enatween - 1 freq endanger - 1 freq emotional - 37 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 - ENTNT entent - 1 freq |
ENTENT |
| Time to execute Levenshtein function - 0.204443 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.350226 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.027709 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.071129 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.000854 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. |