| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dwarvies (0) - 5 freq dwarves (1) - 6 freq dwarvies' (1) - 1 freq darkies (2) - 2 freq diaries (2) - 5 freq davies (2) - 13 freq bardies (3) - 1 freq larries (3) - 8 freq scarves (3) - 7 freq wirdies (3) - 13 freq daisies (3) - 20 freq warie (3) - 1 freq derbies (3) - 2 freq dallies (3) - 5 freq warnins (3) - 5 freq wirries (3) - 10 freq heavies (3) - 5 freq swarrie (3) - 1 freq waives (3) - 1 freq jarvie (3) - 5 freq swarees (3) - 1 freq wharves (3) - 1 freq kwarved (3) - 1 freq sparkies (3) - 2 freq daffies (3) - 4 freq |
dwarvies (0) - 5 freq dwarves (1) - 6 freq dwarvies' (2) - 1 freq desarves (4) - 1 freq dwarts (4) - 1 freq dwarfs (4) - 5 freq diaries (4) - 5 freq darkies (4) - 2 freq davies (4) - 13 freq workies (5) - 1 freq wares (5) - 6 freq wordies (5) - 6 freq wirkies (5) - 1 freq dares (5) - 5 freq divvies (5) - 1 freq drives (5) - 27 freq daves (5) - 2 freq dries (5) - 8 freq deservis (5) - 1 freq edwards (5) - 5 freq wurries (5) - 2 freq lawvies (5) - 1 freq derkies (5) - 1 freq waves (5) - 139 freq sarves (5) - 2 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 |
DWARVIES |
| Time to execute Levenshtein function - 0.416963 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.578291 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.027839 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.077625 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.000977 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. |