| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| darker (0) - 9 freq barker (1) - 1 freq parker (1) - 19 freq darger (1) - 2 freq derker (1) - 7 freq daurker (1) - 11 freq dairker (1) - 1 freq daiker (1) - 2 freq darken (1) - 3 freq warker (1) - 7 freq marker (1) - 11 freq wanker (2) - 14 freq taaker (2) - 1 freq baker (2) - 26 freq dazler (2) - 2 freq dyker (2) - 4 freq drier (2) - 9 freq yarken (2) - 2 freq dakes (2) - 1 freq danser (2) - 1 freq akker (2) - 1 freq dirler (2) - 1 freq yarder (2) - 1 freq damper (2) - 3 freq birker (2) - 1 freq |
darker (0) - 9 freq daurker (1) - 11 freq dairker (1) - 1 freq derker (1) - 7 freq darken (2) - 3 freq warker (2) - 7 freq daiker (2) - 2 freq marker (2) - 11 freq darger (2) - 2 freq barker (2) - 1 freq parker (2) - 19 freq mirker (3) - 1 freq yorker (3) - 1 freq yerker (3) - 1 freq darkie (3) - 2 freq durer (3) - 1 freq wirker (3) - 5 freq wurker (3) - 3 freq darfur (3) - 1 freq merker (3) - 6 freq darkley (3) - 7 freq dryer (3) - 5 freq mairker (3) - 1 freq darkle (3) - 1 freq decker (3) - 12 freq |
SoundEx code - D626 dresser - 23 freq darker - 9 freq derker - 7 freq darger - 2 freq daurker - 11 freq daurk-haired - 2 freq diregaird - 1 freq dairker - 1 freq daark-haired - 1 freq dressers - 1 freq drug-ring - 1 freq darkrife - 1 freq darg-year - 1 freq dargers - 1 freq derk-haired - 1 freq dark-hair - 1 freq dreicher - 1 freq doriccroissant - 1 freq drewjarviescomb - 7 freq derrygirls - 1 freq derekcorner - 1 freq drgarypamplin - 1 freq dragraceukbbc - 1 freq dirkrobertsonart - 1 freq drcharlesl - 1 freq |
MetaPhone code - TRKR darker - 9 freq trigger - 13 freq derker - 7 freq daurker - 11 freq troqueer - 2 freq trickerie - 1 freq dairker - 1 freq trickery - 1 freq troker - 1 freq trokerie - 1 freq trooker - 2 freq trucker - 1 freq torkirra - 1 freq |
DARKER |
| Time to execute Levenshtein function - 0.190092 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.362230 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.028276 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.039947 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.000900 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. |