Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dirled (0) - 10 freq dirler (1) - 1 freq pirled (1) - 3 freq dirded (1) - 1 freq dilled (1) - 3 freq birled (1) - 69 freq mirled (1) - 2 freq tirled (1) - 6 freq rifled (2) - 1 freq died (2) - 152 freq hired (2) - 27 freq dipped (2) - 23 freq wirked (2) - 35 freq dimmed (2) - 5 freq yirded (2) - 4 freq furled (2) - 11 freq dibbled (2) - 1 freq dire (2) - 9 freq birsed (2) - 5 freq aidled (2) - 1 freq sired (2) - 2 freq swirled (2) - 3 freq oiled (2) - 1 freq dirlt (2) - 4 freq wired (2) - 15 freq |
dirled (0) - 10 freq birled (2) - 69 freq tirled (2) - 6 freq dilled (2) - 3 freq mirled (2) - 2 freq dirded (2) - 1 freq pirled (2) - 3 freq dirler (2) - 1 freq dirlan (3) - 3 freq dirl (3) - 45 freq daled (3) - 5 freq harled (3) - 6 freq darned (3) - 2 freq darted (3) - 5 freq doled (3) - 3 freq dialled (3) - 2 freq dulled (3) - 1 freq dared (3) - 11 freq dried (3) - 71 freq daidled (3) - 1 freq burled (3) - 2 freq murled (3) - 1 freq darged (3) - 1 freq marled (3) - 2 freq draed (3) - 1 freq |
SoundEx code - D643 dreelt - 1 freq dirled - 10 freq dirl't - 1 freq dirlt - 4 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 - 10 freq trolled - 1 freq trail't - 4 freq dirl't - 1 freq dirlt - 4 freq tirlt - 2 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.175047 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.338021 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.027243 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.037188 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.000800 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. |