| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dwarts (0) - 1 freq warts (1) - 5 freq dwarfs (1) - 5 freq darts (1) - 32 freq dearth (2) - 9 freq dwalt (2) - 4 freq dwaums (2) - 5 freq upwarts (2) - 2 freq twatts (2) - 1 freq warty (2) - 1 freq dairts (2) - 2 freq carts (2) - 2 freq parts (2) - 24 freq dysarts (2) - 1 freq warps (2) - 1 freq darth (2) - 3 freq dwams (2) - 18 freq dwalls (2) - 1 freq dwts (2) - 1 freq drafts (2) - 2 freq warks (2) - 132 freq warns (2) - 2 freq warms (2) - 8 freq dorts (2) - 8 freq dargs (2) - 4 freq |
dwarts (0) - 1 freq dwarfs (2) - 5 freq darts (2) - 32 freq warts (2) - 5 freq edwards (3) - 5 freq dysarts (3) - 1 freq dwts (3) - 1 freq derts (3) - 2 freq onwarts (3) - 1 freq twartis (3) - 7 freq departs (3) - 2 freq dairts (3) - 2 freq dirts (3) - 1 freq upwarts (3) - 2 freq dewar's (3) - 1 freq dowfarts (3) - 1 freq edwart (3) - 5 freq dorts (3) - 8 freq dwarves (3) - 6 freq towarts (3) - 5 freq walts (4) - 1 freq wants (4) - 295 freq smarts (4) - 1 freq war's (4) - 3 freq dears (4) - 12 freq |
SoundEx code - D632 dorts - 8 freq drouths - 1 freq dorothy's - 3 freq dredge - 2 freq dredger - 1 freq darts - 32 freq drudgery - 3 freq dwarts - 1 freq dredged - 3 freq dairths - 1 freq dordogne - 1 freq druids - 5 freq druidic - 1 freq dirty-kneed - 1 freq drewits - 2 freq dreids - 2 freq dreidsomelookin - 1 freq derts - 2 freq dredgin - 2 freq dratsis - 2 freq dratsi - 7 freq dreidsome - 1 freq drouth's - 1 freq drooths - 1 freq dorados - 1 freq dairts - 2 freq dirts - 1 freq dratsie - 1 freq dorothykoomson - 2 freq dartagnan - 1 freq draatsi - 2 freq |
MetaPhone code - TWRTS towards - 170 freq taewards - 186 freq towarts - 5 freq tiward's - 5 freq teward's - 1 freq toward's - 1 freq taeward's - 1 freq tiwards - 3 freq dwarts - 1 freq tawards - 7 freq twaards - 1 freq 'tawards' - 1 freq taewarts - 1 freq twartis - 7 freq towartis - 2 freq taywords - 1 freq |
DWARTS |
| Time to execute Levenshtein function - 0.194978 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.340968 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.030525 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.039299 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.000958 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. |