| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| daurkest (0) - 5 freq darkest (1) - 16 freq dairkest (1) - 3 freq dourest (2) - 3 freq daurkness (2) - 20 freq daurker (2) - 11 freq derkest (2) - 2 freq naurest (2) - 1 freq haurdest (2) - 1 freq daurkens (2) - 1 freq fardest (3) - 4 freq warmest (3) - 5 freq daurnt (3) - 1 freq daurk (3) - 195 freq waurst (3) - 5 freq dourles (3) - 4 freq daunert (3) - 14 freq darker (3) - 9 freq narrest (3) - 6 freq duress (3) - 4 freq darken (3) - 3 freq purest (3) - 4 freq rarest (3) - 4 freq auldest (3) - 46 freq harkent (3) - 1 freq |
daurkest (0) - 5 freq darkest (1) - 16 freq dairkest (1) - 3 freq derkest (2) - 2 freq dourest (3) - 3 freq durkit (4) - 1 freq markeast (4) - 1 freq durst (4) - 1 freq darkish (4) - 1 freq mirkest (4) - 2 freq darkies (4) - 2 freq dearest (4) - 19 freq naurest (4) - 1 freq daurker (4) - 11 freq daurkness (4) - 20 freq daurkens (4) - 1 freq haurdest (4) - 1 freq driest (4) - 7 freq surest (5) - 1 freq daftest (5) - 4 freq faardest (5) - 1 freq parkes (5) - 2 freq lairgest (5) - 9 freq faircest (5) - 1 freq daarkness (5) - 2 freq |
SoundEx code - D622 dresses - 18 freq door-cheek - 3 freq darkest - 16 freq dairkest - 3 freq derkest - 2 freq darkish - 1 freq daurkest - 5 freq druggies - 1 freq drakes - 2 freq door-cheek's - 1 freq driechest - 2 freq door-chik - 1 freq darkies - 2 freq dreichest - 2 freq derkies - 1 freq dirges - 1 freq dregies - 1 freq dreich-as-cauld-parritch - 1 freq durexuk - 1 freq drkkhgagrj - 1 freq doricocd - 1 freq derekweston - 5 freq drxuaywz - 1 freq darcyoake - 2 freq drjoshuawolrich - 1 freq |
MetaPhone code - TRKST triggest - 1 freq tracksuit - 7 freq darkest - 16 freq dairkest - 3 freq derkest - 2 freq daurkest - 5 freq trak-syde - 1 freq darkside - 1 freq |
DAURKEST |
| Time to execute Levenshtein function - 0.238784 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.401212 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.029144 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.043335 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.001280 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. |