| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| darfur (0) - 1 freq darger (2) - 2 freq armur (2) - 1 freq arfu (2) - 1 freq artur (2) - 1 freq oaffur (2) - 1 freq darker (2) - 9 freq oafur (2) - 1 freq farfir (2) - 2 freq earful (2) - 2 freq daur (2) - 73 freq forfar (3) - 10 freq darcy (3) - 4 freq farter (3) - 1 freq warrum (3) - 1 freq farrer (3) - 27 freq dafter (3) - 6 freq hanfu (3) - 10 freq danger (3) - 109 freq darns (3) - 1 freq wardour (3) - 1 freq kaur (3) - 4 freq dar (3) - 86 freq difer (3) - 2 freq r'ur (3) - 1 freq |
darfur (0) - 1 freq farfir (3) - 2 freq darker (3) - 9 freq darger (3) - 2 freq duffer (4) - 6 freq dirler (4) - 1 freq drahr (4) - 1 freq dykefur (4) - 1 freq surfer (4) - 1 freq drier (4) - 9 freq dhofar (4) - 1 freq duror (4) - 1 freq durer (4) - 1 freq deefer (4) - 1 freq derker (4) - 7 freq dfr (4) - 2 freq dorr (4) - 43 freq daurker (4) - 11 freq dearer (4) - 8 freq drar (4) - 1 freq drfw (4) - 1 freq derf (4) - 2 freq drf (4) - 1 freq dormer (4) - 2 freq draar (4) - 6 freq |
SoundEx code - D616 drawbrig - 1 freq drapers - 1 freq driver - 89 freq drap-ripe - 4 freq drivers - 23 freq drappr - 1 freq drover - 1 freq driver's - 8 freq d'urbervilles - 1 freq dreeprt - 1 freq dryborough - 1 freq drapper - 1 freq dryvar - 1 freq drivers' - 1 freq draver's - 1 freq draver - 2 freq dhriver - 1 freq draper - 2 freq dryvers - 1 freq draw-brig - 1 freq drovers - 2 freq dreiver - 1 freq €œdriver - 1 freq darfur - 1 freq draabore - 1 freq driverminnie - 3 freq drbrooski - 1 freq dorriefraser - 2 freq |
MetaPhone code - TRFR driver - 89 freq drover - 1 freq dryvar - 1 freq draver - 2 freq dhriver - 1 freq dreiver - 1 freq €œdriver - 1 freq darfur - 1 freq trevor - 3 freq |
DARFUR |
| Time to execute Levenshtein function - 0.214569 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.415529 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.029667 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.039303 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.000777 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. |