| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| darkest (0) - 16 freq derkest (1) - 2 freq daurkest (1) - 5 freq dairkest (1) - 3 freq damnest (2) - 1 freq warmest (2) - 5 freq harkent (2) - 1 freq largest (2) - 5 freq arrest (2) - 9 freq harvest (2) - 16 freq earnest (2) - 13 freq darkish (2) - 1 freq carket (2) - 1 freq darknes (2) - 1 freq rarest (2) - 4 freq darkens (2) - 1 freq darken (2) - 3 freq parkes (2) - 2 freq waikest (2) - 1 freq darkness (2) - 71 freq narrest (2) - 6 freq driest (2) - 7 freq dark's (2) - 1 freq dakes (2) - 1 freq yarket (2) - 3 freq |
darkest (0) - 16 freq derkest (1) - 2 freq dairkest (1) - 3 freq daurkest (1) - 5 freq driest (3) - 7 freq dearest (3) - 19 freq darkish (3) - 1 freq darkies (3) - 2 freq markeast (3) - 1 freq mirkest (3) - 2 freq fardest (4) - 4 freq earnest (4) - 13 freq drakes (4) - 2 freq dares (4) - 5 freq warmest (4) - 5 freq hardest (4) - 17 freq diarist (4) - 1 freq market (4) - 51 freq damnest (4) - 1 freq durkit (4) - 1 freq dourest (4) - 3 freq darksum (4) - 1 freq derkies (4) - 1 freq dresst (4) - 10 freq dorset (4) - 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 |
DARKEST |
| Time to execute Levenshtein function - 0.239266 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.452878 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.035730 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.040797 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.000937 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. |