| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| debunking (0) - 1 freq debuting (2) - 1 freq debating (3) - 4 freq defusing (3) - 1 freq bulking (3) - 1 freq busking (3) - 1 freq demanding (3) - 4 freq dunkin (3) - 2 freq defending (3) - 5 freq duncing (3) - 3 freq banking (3) - 3 freq daunting (3) - 1 freq deuing (3) - 1 freq bunting (3) - 8 freq denying (3) - 3 freq dunning (3) - 1 freq defining (3) - 3 freq depending (3) - 6 freq drinking (3) - 18 freq ducking (3) - 2 freq decking (3) - 1 freq bulkin (4) - 1 freq droning (4) - 1 freq leukin (4) - 256 freq funning (4) - 1 freq |
debunking (0) - 1 freq banking (4) - 3 freq drinking (4) - 18 freq debuting (4) - 1 freq dunning (5) - 1 freq denying (5) - 3 freq defining (5) - 3 freq depending (5) - 6 freq debating (5) - 4 freq ducking (5) - 2 freq bunting (5) - 8 freq decking (5) - 1 freq demanding (5) - 4 freq bulking (5) - 1 freq dunkin (5) - 2 freq busking (5) - 1 freq defending (5) - 5 freq duncing (5) - 3 freq daunting (5) - 1 freq bankin (6) - 19 freq drunken (6) - 23 freq booking (6) - 5 freq thanking (6) - 1 freq doubling (6) - 1 freq baking (6) - 9 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 - TBNKNK debunking - 1 freq |
DEBUNKING |
| Time to execute Levenshtein function - 0.224297 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.388959 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.029170 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.037355 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.001285 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. |