| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| duration (0) - 5 freq aduration (1) - 1 freq oration (2) - 1 freq 'duration' (2) - 1 freq mutation (2) - 1 freq survation (2) - 4 freq donation (2) - 12 freq ration (2) - 4 freq adoration (2) - 6 freq education (2) - 415 freq moderation (3) - 4 freq gratin (3) - 4 freq dilution (3) - 2 freq gumption (3) - 12 freq draigon (3) - 9 freq quastion (3) - 2 freq horatian (3) - 1 freq curator (3) - 5 freq adulatioun (3) - 1 freq equation (3) - 5 freq 'education (3) - 2 freq deletion (3) - 1 freq operation (3) - 41 freq neducation (3) - 4 freq narration (3) - 1 freq |
duration (0) - 5 freq aduration (1) - 1 freq adoration (2) - 6 freq education (3) - 415 freq dertin (3) - 1 freq donation (3) - 12 freq ration (3) - 4 freq oration (3) - 1 freq dartin (3) - 5 freq cratin (4) - 1 freq durtie (4) - 2 freq derision (4) - 8 freq dragoon (4) - 1 freq duettin (4) - 1 freq edication (4) - 3 freq portion (4) - 22 freq direction (4) - 120 freq durritin (4) - 1 freq dramin (4) - 1 freq drawin (4) - 113 freq gyratin (4) - 1 freq draain (4) - 15 freq educatin (4) - 4 freq derivation (4) - 2 freq duran (4) - 3 freq |
SoundEx code - D635 dirdum - 20 freq dreidin - 4 freq dirdums - 2 freq dauredna - 1 freq daurdna - 3 freq droddum - 1 freq dirdin - 10 freq deridin - 1 freq dreadin - 8 freq dartin - 5 freq dreedan - 1 freq darting - 1 freq dirdan - 1 freq dreadnaucht - 1 freq drouthienes - 1 freq dertin - 1 freq dortan - 1 freq duration - 5 freq 'duration' - 1 freq dirtyin - 1 freq dartan - 1 freq duardna - 1 freq dreid-na - 1 freq daar'tna - 1 freq dritten - 1 freq dryden - 2 freq dreadin' - 1 freq derting - 1 freq dortmund - 1 freq durritin - 1 freq dirdoinmyheadinalready - 1 freq |
MetaPhone code - TRXN derision - 8 freq dereision - 2 freq dereeshion - 4 freq duration - 5 freq 'duration' - 1 freq treshin - 1 freq trashin - 1 freq |
DURATION |
| Time to execute Levenshtein function - 0.299618 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.608847 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.027804 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.056817 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.000904 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. |