| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dreedlin (0) - 1 freq dreeblin (1) - 3 freq dreeplin (1) - 1 freq dreezlin (1) - 1 freq dreelin (1) - 1 freq creelin (2) - 2 freq dredgin (2) - 2 freq wheedlin (2) - 2 freq dreepin (2) - 66 freq dreidin (2) - 4 freq reelin (2) - 16 freq dreelit (2) - 1 freq deelin (2) - 1 freq dreedan (2) - 1 freq weedlin (2) - 1 freq dreein (2) - 1 freq seedlin (2) - 2 freq breedin (2) - 9 freq dreillin (2) - 1 freq deedlie (2) - 1 freq dreadin (2) - 9 freq treetlin (2) - 5 freq rettlin (3) - 2 freq deefnin (3) - 1 freq duellin (3) - 2 freq |
dreedlin (0) - 1 freq dreeblin (2) - 3 freq dreelin (2) - 1 freq dreezlin (2) - 1 freq dreeplin (2) - 1 freq dreidin (3) - 4 freq dreedan (3) - 1 freq dreillin (3) - 1 freq dreadin (3) - 9 freq dredgin (3) - 2 freq draalin (4) - 2 freq dawdlin (4) - 2 freq drillin (4) - 13 freq doodlin (4) - 2 freq deidline (4) - 1 freq diddlin (4) - 2 freq deadline (4) - 4 freq draiglin (4) - 1 freq drawlin (4) - 7 freq driplin (4) - 1 freq derklin (4) - 1 freq croodlin (4) - 5 freq droolin (4) - 3 freq derlin (4) - 1 freq driblin (4) - 1 freq |
SoundEx code - D634 dirdy-lochrag - 1 freq drouthilie - 1 freq drittlin - 2 freq drittled - 2 freq drittles - 1 freq drittlaboot - 1 freq dreedlin - 1 freq drittle - 1 freq dreadlocks - 1 freq droothyloony - 1 freq duartlodge - 2 freq |
MetaPhone code - TRTLN traitlin - 1 freq troddlin - 3 freq tröttlin - 3 freq drittlin - 2 freq trottlin - 1 freq trøtlin - 2 freq dreedlin - 1 freq treetlin - 5 freq |
DREEDLIN |
| Time to execute Levenshtein function - 0.228787 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.409886 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.034500 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.044886 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.001097 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. |