| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| definsive (0) - 1 freq defensive (1) - 9 freq devisive (2) - 2 freq definsively (2) - 1 freq definite (2) - 19 freq decisive (2) - 3 freq definitive (2) - 8 freq decisive' (3) - 1 freq deintie (3) - 2 freq definiteive (3) - 1 freq defining (3) - 3 freq define (3) - 11 freq defince (3) - 2 freq offensive (3) - 12 freq defensively (3) - 1 freq pensive (3) - 2 freq definin' (3) - 1 freq divisive (3) - 7 freq definin (3) - 4 freq definit (3) - 3 freq defense (3) - 1 freq expinsive (3) - 1 freq density (4) - 4 freq benside (4) - 1 freq i'inside (4) - 1 freq |
definsive (0) - 1 freq defensive (1) - 9 freq definitive (3) - 8 freq definsively (3) - 1 freq definiteive (4) - 1 freq offensive (4) - 12 freq defensively (4) - 1 freq defense (4) - 1 freq devisive (4) - 2 freq decisive (4) - 3 freq definite (4) - 19 freq definin (5) - 4 freq expinsive (5) - 1 freq defenses (5) - 1 freq divisive (5) - 7 freq defines (5) - 7 freq definit (5) - 3 freq definin' (5) - 1 freq defining (5) - 3 freq define (5) - 11 freq pensive (5) - 2 freq defince (5) - 2 freq dense (6) - 12 freq deafens (6) - 1 freq deeins (6) - 7 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 - TFNSF defensive - 9 freq definsive - 1 freq |
DEFINSIVE |
| Time to execute Levenshtein function - 0.259495 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.605949 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.029342 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.071941 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.000998 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. |