| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| defmqgvx (0) - 1 freq defqmha (4) - 1 freq demon (5) - 23 freq descryve (5) - 2 freq defy (5) - 6 freq deeve (5) - 5 freq nsmrvx (5) - 1 freq emva (5) - 1 freq dfpxv (5) - 1 freq dermot (5) - 1 freq demur (5) - 1 freq descrive (5) - 25 freq demands (5) - 21 freq eqvy (5) - 1 freq demos (5) - 2 freq demos- (5) - 2 freq defaut (5) - 20 freq remuive (5) - 4 freq defn (5) - 3 freq derive (5) - 2 freq eemage (5) - 18 freq zfoqx (5) - 1 freq eemages (5) - 15 freq deimos (5) - 1 freq damege (5) - 1 freq |
defmqgvx (0) - 1 freq defqmha (8) - 1 freq damaged (9) - 15 freq defensive (9) - 10 freq damages (9) - 1 freq fgx (9) - 1 freq mqx (9) - 1 freq ideqv (9) - 1 freq dwaigx (9) - 1 freq defining (9) - 3 freq damagin (9) - 3 freq rmqsv (9) - 1 freq fnqv (9) - 1 freq defamed (9) - 1 freq daimige (9) - 1 freq damage (9) - 45 freq omgx (9) - 1 freq defusing (9) - 1 freq dufv (9) - 1 freq fmq (9) - 1 freq mgv (9) - 1 freq dkqdvr (9) - 1 freq devomax (9) - 2 freq dimriv (9) - 3 freq definsive (9) - 1 freq |
SoundEx code - D152 daffins - 1 freq defines - 7 freq defensive - 10 freq deavances - 1 freq defence - 46 freq dobbin's - 1 freq deepins - 1 freq deafens - 1 freq defences - 5 freq defenestration - 1 freq devonshire - 1 freq divines - 1 freq defince - 2 freq definsively - 1 freq diaphanous-wingit - 1 freq dipping - 3 freq defiance - 13 freq dippin-machines - 1 freq defense - 1 freq definsive - 1 freq dipomacy - 1 freq diaphinous - 1 freq devensian - 1 freq deepmaist - 1 freq deefness - 1 freq defenceless - 3 freq defensively - 1 freq defankelise - 1 freq deifness - 1 freq defenses - 1 freq €œdeifness - 2 freq defmqgvx - 1 freq davemcro - 1 freq debnicol - 5 freq debunking - 1 freq devomax - 2 freq dfmcifps - 1 freq devenickdairy - 1 freq |
MetaPhone code - TFMKKFKS defmqgvx - 1 freq |
DEFMQGVX |
| Time to execute Levenshtein function - 0.201520 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.426023 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.027909 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.040071 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.000896 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. |