| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| durer (0) - 1 freq duror (1) - 1 freq dure (1) - 64 freq dures (1) - 3 freq purer (1) - 2 freq dourer (1) - 2 freq dune (2) - 103 freq durty (2) - 11 freq doner (2) - 2 freq due (2) - 177 freq dare (2) - 61 freq airer (2) - 1 freq durin (2) - 183 freq dueler (2) - 1 freq sumer (2) - 1 freq outer (2) - 4 freq dater (2) - 1 freq turner (2) - 8 freq dearer (2) - 8 freq murmer (2) - 2 freq auler (2) - 17 freq murder (2) - 86 freq curers (2) - 1 freq deter (2) - 4 freq furr (2) - 12 freq |
durer (0) - 1 freq dourer (1) - 2 freq duror (1) - 1 freq dorr (2) - 43 freq drear (2) - 10 freq dearer (2) - 8 freq dryer (2) - 5 freq drar (2) - 1 freq dures (2) - 3 freq dure (2) - 64 freq drier (2) - 9 freq purer (2) - 2 freq dyker (3) - 4 freq dores (3) - 1 freq dooer (3) - 1 freq carer (3) - 10 freq puirer (3) - 6 freq daured (3) - 24 freq dower (3) - 2 freq dcer (3) - 1 freq dover (3) - 16 freq burr (3) - 2 freq dura (3) - 1 freq dorro (3) - 1 freq dury (3) - 1 freq |
SoundEx code - D660 dreary - 13 freq drawer - 132 freq dryer - 5 freq drear - 10 freq dearer - 8 freq draaer - 2 freq drier - 9 freq durer - 1 freq draar - 6 freq drahr - 1 freq drearie - 1 freq dourer - 2 freq drar - 1 freq duror - 1 freq draer - 1 freq |
MetaPhone code - TRR terrier - 13 freq terror - 40 freq dreary - 13 freq drear - 10 freq dearer - 8 freq trurh - 1 freq draaer - 2 freq drier - 9 freq durer - 1 freq draar - 6 freq truer - 5 freq drahr - 1 freq terrour - 1 freq drearie - 1 freq dourer - 2 freq drar - 1 freq tarrier - 1 freq duror - 1 freq truiro - 1 freq draer - 1 freq |
DURER |
| Time to execute Levenshtein function - 0.199789 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.356006 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.028240 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.043735 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.001216 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. |