| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dervish (0) - 2 freq nervish (1) - 8 freq jervis (2) - 1 freq vertish (2) - 1 freq dervil (2) - 1 freq perish (2) - 12 freq deish (2) - 6 freq devise (2) - 2 freq delish (2) - 2 freq verish (2) - 1 freq hervist (2) - 1 freq darkish (2) - 1 freq peevish (2) - 2 freq dervishes (2) - 1 freq denish' (3) - 1 freq derting (3) - 1 freq deivin (3) - 1 freq garish (3) - 1 freq merkis (3) - 2 freq pervs (3) - 1 freq neirish (3) - 2 freq devilish (3) - 4 freq delvit (3) - 1 freq derkies (3) - 1 freq despise (3) - 5 freq |
dervish (0) - 2 freq nervish (2) - 8 freq darkish (3) - 1 freq dervishes (3) - 1 freq dervil (4) - 1 freq drush (4) - 7 freq derives (4) - 10 freq ravish (4) - 1 freq jervis (4) - 1 freq peevish (4) - 2 freq vertish (4) - 1 freq deish (4) - 6 freq perish (4) - 12 freq devise (4) - 2 freq delish (4) - 2 freq hervist (4) - 1 freq verish (4) - 1 freq druith (5) - 1 freq 'irish (5) - 2 freq der's (5) - 31 freq desh (5) - 1 freq droich (5) - 4 freq dish (5) - 73 freq derth (5) - 2 freq devisit (5) - 4 freq |
SoundEx code - D612 dreeps - 13 freq droves - 10 freq dribs - 3 freq draps - 62 freq drops - 18 freq drives - 27 freq drops' - 1 freq dwarves - 6 freq dwarvies - 5 freq dwarvies' - 1 freq dervish - 2 freq dervishes - 1 freq drap's - 1 freq draabak - 1 freq draabaak - 1 freq dwarfs - 5 freq drips - 5 freq droaps - 4 freq drive's - 1 freq driveways - 2 freq drops'll - 1 freq drivas - 1 freq drawbacks - 2 freq derives - 10 freq drabbest - 1 freq drapes - 6 freq draabacks - 1 freq draaback - 2 freq droppis - 1 freq drappies - 2 freq dropsey - 1 freq drybowks - 1 freq dervock - 1 freq derbies - 2 freq drap-kickin - 1 freq |
MetaPhone code - TRFX dervish - 2 freq |
DERVISH |
| Time to execute Levenshtein function - 0.268484 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.657351 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.032047 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.076105 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.001319 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. |