| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| demeanour (0) - 5 freq eleanor (3) - 10 freq demean (3) - 1 freq demeaned (3) - 1 freq demeanin (3) - 3 freq dementia (4) - 9 freq dreidour (4) - 1 freq meander (4) - 2 freq deepur (4) - 1 freq deener (4) - 3 freq bemeanit (4) - 1 freq deman (4) - 1 freq demaun (4) - 1 freq beglamour (4) - 3 freq behavour (4) - 1 freq demandan (4) - 1 freq devour (4) - 7 freq neebour (4) - 37 freq belabour (4) - 1 freq detector (4) - 7 freq demaands (4) - 3 freq deenner (4) - 1 freq bemeaning (4) - 1 freq eenou (4) - 14 freq deengir (4) - 1 freq |
demeanour (0) - 5 freq demeaned (4) - 1 freq demeanin (4) - 3 freq demean (4) - 1 freq manor (5) - 4 freq demans (5) - 1 freq demaun (5) - 1 freq deenner (5) - 1 freq deman (5) - 1 freq deener (5) - 3 freq demand (5) - 51 freq dementia (5) - 9 freq eleanor (5) - 10 freq demur (5) - 1 freq demauns (6) - 1 freq dampener (6) - 1 freq minor (6) - 15 freq dominos (6) - 5 freq daenner (6) - 1 freq demon (6) - 22 freq demanded (6) - 9 freq demn (6) - 2 freq dementit (6) - 22 freq donor (6) - 7 freq manure (6) - 7 freq |
SoundEx code - D556 danemerk - 3 freq demeanour - 5 freq domineerin - 1 freq dinin-room - 11 freq dininroom - 1 freq doonhamer-land - 1 freq doonhamers - 1 freq doon-unnér - 1 freq €œdomineired - 1 freq |
MetaPhone code - TMNR demeanour - 5 freq tammynorie - 1 freq |
DEMEANOUR |
| Time to execute Levenshtein function - 0.182671 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.380929 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.028838 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.037515 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.000800 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. |