| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| defenses (0) - 1 freq defense (1) - 1 freq defences (1) - 4 freq defines (2) - 7 freq defended (2) - 3 freq defence (2) - 43 freq defenders (2) - 8 freq defends (2) - 1 freq defender (2) - 5 freq decense (2) - 1 freq defend (3) - 23 freq refuses (3) - 17 freq defensive (3) - 9 freq deftness (3) - 2 freq denies (3) - 12 freq refeese (3) - 1 freq eense (3) - 16 freq deceased (3) - 7 freq deeves (3) - 1 freq diseases (3) - 8 freq cevennes (3) - 1 freq insenses (3) - 1 freq meentes (3) - 1 freq referees (3) - 2 freq defendent (3) - 1 freq |
defenses (0) - 1 freq defences (2) - 4 freq defense (2) - 1 freq defends (3) - 1 freq defines (3) - 7 freq deifness (4) - 1 freq deefness (4) - 1 freq defensive (4) - 9 freq deafens (4) - 1 freq deftness (4) - 2 freq defenders (4) - 8 freq defended (4) - 3 freq defender (4) - 5 freq defence (4) - 43 freq decense (4) - 1 freq denser (5) - 2 freq dense (5) - 12 freq depends (5) - 38 freq expenses (5) - 8 freq defies (5) - 2 freq fences (5) - 22 freq defendit (5) - 2 freq deen's (5) - 3 freq menses (5) - 1 freq defined (5) - 21 freq |
SoundEx code - D152 daffins - 1 freq defines - 7 freq defensive - 9 freq deavances - 1 freq defence - 43 freq dobbin's - 1 freq deepins - 1 freq deafens - 1 freq devonshire - 1 freq defences - 4 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 - TFNSS deavances - 1 freq defences - 4 freq defenses - 1 freq |
DEFENSES |
| Time to execute Levenshtein function - 0.208118 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.370217 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.028529 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.038941 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.000855 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. |