| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dirled (0) - 11 freq birled (1) - 69 freq dirded (1) - 1 freq dilled (1) - 3 freq dirler (1) - 1 freq pirled (1) - 3 freq mirled (1) - 2 freq tirled (1) - 6 freq twirled (2) - 2 freq dryed (2) - 4 freq titled (2) - 2 freq tiled (2) - 2 freq snirled (2) - 2 freq filled (2) - 152 freq sidled (2) - 2 freq dirges (2) - 1 freq thirled (2) - 20 freq skirled (2) - 101 freq iled (2) - 1 freq diced (2) - 4 freq mired (2) - 2 freq diddled (2) - 2 freq airmed (2) - 21 freq dirge (2) - 5 freq darted (2) - 5 freq |
dirled (0) - 11 freq tirled (2) - 6 freq birled (2) - 69 freq pirled (2) - 3 freq mirled (2) - 2 freq dirler (2) - 1 freq dilled (2) - 3 freq dirded (2) - 1 freq dirlan (3) - 3 freq dirlit (3) - 1 freq darned (3) - 2 freq aidled (3) - 1 freq dared (3) - 11 freq daled (3) - 5 freq daidled (3) - 1 freq draed (3) - 1 freq dolled (3) - 6 freq drilled (3) - 1 freq gurled (3) - 10 freq harled (3) - 6 freq burled (3) - 2 freq wirld (3) - 73 freq dirl (3) - 46 freq furled (3) - 11 freq riled (3) - 9 freq |
SoundEx code - D643 dreelt - 1 freq dirled - 11 freq dirl't - 1 freq dirlt - 4 freq drilled - 1 freq drillit - 1 freq driltan - 1 freq dirl-dirlin - 1 freq dirlit - 1 freq dreelit - 1 freq drewlawdesign - 6 freq |
MetaPhone code - TRLT dreelt - 1 freq trailed - 17 freq dirled - 11 freq trolled - 1 freq trail't - 4 freq dirl't - 1 freq dirlt - 4 freq tirlt - 2 freq drilled - 1 freq tirlit - 2 freq trailt - 7 freq drillit - 1 freq trilled - 1 freq traaled - 1 freq trawlt - 1 freq tirled - 6 freq traawled - 1 freq dirlit - 1 freq trawled - 3 freq dreelit - 1 freq trialt - 1 freq trelt - 1 freq |
DIRLED |
| Time to execute Levenshtein function - 0.303326 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.674560 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.081440 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.084336 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.000857 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. |