| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dwarves (0) - 6 freq dwarvies (1) - 5 freq tarves (2) - 8 freq waives (2) - 1 freq swarees (2) - 1 freq dwarfs (2) - 5 freq diaries (2) - 5 freq dares (2) - 5 freq wares (2) - 6 freq scarves (2) - 7 freq dwarts (2) - 1 freq desarves (2) - 1 freq daves (2) - 2 freq waves (2) - 139 freq dwarvies' (2) - 1 freq wharves (2) - 1 freq sarves (2) - 2 freq kwarved (2) - 1 freq laves (3) - 3 freq waved (3) - 63 freq dales (3) - 6 freq hares (3) - 14 freq davey (3) - 13 freq taves (3) - 4 freq dwaumed (3) - 1 freq |
dwarves (0) - 6 freq dwarvies (1) - 5 freq dwarfs (3) - 5 freq dwarts (3) - 1 freq desarves (3) - 1 freq dwarvies' (3) - 1 freq edwards (4) - 5 freq kwarved (4) - 1 freq deprives (4) - 1 freq desairves (4) - 2 freq droves (4) - 10 freq deserves (4) - 33 freq wrvs (4) - 1 freq dewar's (4) - 1 freq sarves (4) - 2 freq drives (4) - 27 freq derives (4) - 10 freq diaries (4) - 5 freq daves (4) - 2 freq scarves (4) - 7 freq wharves (4) - 1 freq wares (4) - 6 freq dares (4) - 5 freq swarees (4) - 1 freq waives (4) - 1 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 - TWRFS dwarves - 6 freq dwarvies - 5 freq dwarvies' - 1 freq dwarfs - 5 freq |
DWARVES |
| Time to execute Levenshtein function - 0.195024 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.386985 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.027962 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.038287 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.000948 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. |