| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| demeanour (0) - 5 freq demeanin (3) - 3 freq demean (3) - 1 freq demeaned (3) - 1 freq eleanor (3) - 10 freq dishonour (4) - 3 freq governour (4) - 1 freq demandin (4) - 11 freq defender (4) - 5 freq beglamour (4) - 3 freq endeavour (4) - 11 freq demandan (4) - 1 freq demented (4) - 8 freq bemeaning (4) - 1 freq demur (4) - 1 freq demaun (4) - 1 freq misdemeanours (4) - 1 freq demands (4) - 21 freq detour (4) - 7 freq hereabout (4) - 1 freq eenou (4) - 14 freq demanded (4) - 10 freq deenner (4) - 1 freq pleasour (4) - 1 freq belabour (4) - 1 freq |
demeanour (0) - 5 freq demean (4) - 1 freq demeaned (4) - 1 freq demeanin (4) - 3 freq deenner (5) - 1 freq demaun (5) - 1 freq dementia (5) - 9 freq demans (5) - 1 freq demand (5) - 51 freq demur (5) - 1 freq manor (5) - 4 freq deman (5) - 1 freq deener (5) - 3 freq eleanor (5) - 10 freq demonic (6) - 6 freq demons (6) - 36 freq demauns (6) - 1 freq demonise (6) - 1 freq domino (6) - 10 freq denier (6) - 1 freq danner (6) - 13 freq seminar (6) - 5 freq dreidour (6) - 1 freq demandit (6) - 45 freq manure (6) - 10 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.184795 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.345453 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.027266 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.036926 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.000921 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. |