| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dargers (0) - 1 freq darger (1) - 2 freq dangers (1) - 11 freq daggers (1) - 12 freq hangers (2) - 1 freq darker (2) - 9 freq danders (2) - 8 freq dancers (2) - 37 freq bangers (2) - 3 freq burgers (2) - 11 freq dangeris (2) - 1 freq darged (2) - 1 freq dingers (2) - 3 freq oarders (2) - 2 freq barges (2) - 2 freq dauners (2) - 5 freq careers (2) - 12 freq rangers (2) - 55 freq targets (2) - 6 freq larners (2) - 10 freq barbers (2) - 3 freq wagers (2) - 1 freq darkens (2) - 1 freq targes (2) - 2 freq dodgers (2) - 2 freq |
dargers (0) - 1 freq dangers (2) - 11 freq daggers (2) - 12 freq darger (2) - 2 freq dirges (3) - 1 freq dingers (3) - 3 freq dungers (3) - 3 freq dodgers (3) - 2 freq dargs (3) - 4 freq diggers (3) - 1 freq daungers (3) - 2 freq dangeris (3) - 1 freq burgers (3) - 11 freq dabbers (4) - 1 freq warkers (4) - 43 freq baegers (4) - 1 freq dailers (4) - 2 freq carers (4) - 11 freq cadgers (4) - 1 freq dagger (4) - 4 freq drawers (4) - 52 freq gangers (4) - 2 freq draaers (4) - 3 freq odgers (4) - 1 freq dramers (4) - 1 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 - TRJRS dargers - 1 freq |
DARGERS |
| Time to execute Levenshtein function - 0.230026 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.449580 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.028173 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.070738 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.000851 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. |