| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enatween (0) - 1 freq inatween (1) - 7 freq atween (2) - 1053 freq in-atween (2) - 2 freq 'atween (2) - 1 freq endeen (3) - 3 freq atwen (3) - 1 freq aween (3) - 1 freq bitween (3) - 2 freq €œatweel (3) - 1 freq aatheen (3) - 1 freq naetheen (3) - 3 freq heateen (3) - 1 freq between (3) - 192 freq atwien (3) - 2 freq snawmen (3) - 1 freq echteen (3) - 27 freq aÂ’tween (3) - 1 freq atheen (3) - 1 freq onytheen (3) - 3 freq estreen (3) - 1 freq 'atweel (3) - 3 freq tween (3) - 2 freq a'tween (3) - 1 freq eaten (3) - 31 freq |
enatween (0) - 1 freq inatween (1) - 7 freq in-atween (3) - 2 freq 'atween (3) - 1 freq atween (3) - 1053 freq notheen (4) - 41 freq atwein (4) - 46 freq tween (4) - 2 freq inbetween (4) - 3 freq a'tween (4) - 1 freq 'tween (4) - 1 freq nitheen (4) - 1 freq onytheen (4) - 3 freq ahtween (4) - 2 freq nutheen (4) - 9 freq baetween (4) - 4 freq between (4) - 192 freq naetheen (4) - 3 freq bitween (4) - 2 freq atwien (4) - 2 freq atwen (4) - 1 freq entwined (5) - 3 freq enteezin (5) - 1 freq ent'n (5) - 1 freq nation (5) - 144 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 - ENTWN enatween - 1 freq |
ENATWEEN |
| Time to execute Levenshtein function - 0.402125 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.911426 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.078848 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.043156 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.000929 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. |