| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dwarfs (0) - 5 freq dwarts (1) - 1 freq dwarf (1) - 3 freq dears (2) - 12 freq daars (2) - 1 freq dwaums (2) - 5 freq waifs (2) - 1 freq dewar's (2) - 1 freq warms (2) - 8 freq wars (2) - 61 freq war's (2) - 3 freq dargs (2) - 4 freq datfs (2) - 1 freq daffs (2) - 3 freq dwams (2) - 18 freq scarfs (2) - 4 freq wards (2) - 30 freq wares (2) - 6 freq darts (2) - 32 freq dwalls (2) - 1 freq warks (2) - 132 freq warts (2) - 5 freq swarms (2) - 2 freq warns (2) - 2 freq darns (2) - 1 freq |
dwarfs (0) - 5 freq dwarf (2) - 3 freq dwarts (2) - 1 freq dewar's (3) - 1 freq edwards (3) - 5 freq dwarves (3) - 6 freq warts (4) - 5 freq dwangs (4) - 3 freq awards (4) - 35 freq darns (4) - 1 freq swarms (4) - 2 freq warns (4) - 2 freq warps (4) - 1 freq dares (4) - 5 freq dowers (4) - 1 freq dwarvies (4) - 5 freq waffs (4) - 7 freq warks (4) - 132 freq warls (4) - 4 freq drars (4) - 2 freq doars (4) - 3 freq waifs (4) - 1 freq warms (4) - 8 freq war's (4) - 3 freq dears (4) - 12 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 |
DWARFS |
| Time to execute Levenshtein function - 0.248854 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.411805 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.027756 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.037398 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.000879 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. |