| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drkkhgagrj (0) - 1 freq dark-hair (5) - 1 freq dredger (6) - 1 freq disregaird (6) - 1 freq richard (6) - 71 freq deckchair (6) - 2 freq drars (6) - 2 freq ermchair (6) - 10 freq druggy (6) - 1 freq drags (6) - 8 freq droagin (6) - 1 freq royhair (6) - 3 freq drear (6) - 10 freq drar (6) - 1 freq deckhand (6) - 1 freq dhgate (6) - 1 freq drudgery (6) - 3 freq brodgar (6) - 6 freq dragged (6) - 38 freq orchard (6) - 8 freq druggie (6) - 1 freq brokerage (6) - 1 freq rogart (6) - 1 freq drainage (6) - 3 freq draggit (6) - 12 freq |
drkkhgagrj (0) - 1 freq dark-hair (9) - 1 freq derk-haired (10) - 1 freq drahr (11) - 1 freq drumhirk (11) - 1 freq daurk-haired (11) - 2 freq druggin (11) - 1 freq draggan (11) - 1 freq droggit (11) - 2 freq dreggans (11) - 1 freq drakeford (11) - 1 freq draagged (11) - 1 freq braggart (11) - 2 freq draigged (11) - 2 freq draigg'd (11) - 1 freq dreggan (11) - 1 freq drugged (11) - 4 freq brakkar (11) - 2 freq diregaird (11) - 1 freq draggit (11) - 12 freq xnkheegrl (11) - 1 freq draiggit (11) - 4 freq draggin (11) - 29 freq daark-haired (11) - 1 freq druggie (11) - 1 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 - TRKKKRJ drkkhgagrj - 1 freq |
DRKKHGAGRJ |
| Time to execute Levenshtein function - 0.257012 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.480839 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.039698 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.046757 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.001247 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. |