| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dcfcfrp (0) - 1 freq dqhcprp (3) - 1 freq daffys (4) - 1 freq cclop (4) - 1 freq discord (4) - 5 freq differs (4) - 39 freq dafter (4) - 6 freq deffo (4) - 3 freq dcc (4) - 1 freq daff (4) - 5 freq duncer (4) - 6 freq duncers (4) - 5 freq defers (4) - 1 freq dafft (4) - 2 freq cicero (4) - 1 freq icecap (4) - 1 freq corp (4) - 51 freq accep (4) - 12 freq daffin (4) - 18 freq duffer (4) - 6 freq discard (4) - 1 freq daffy (4) - 1 freq daffed (4) - 3 freq chirp (4) - 2 freq dfc (4) - 2 freq |
dcfcfrp (0) - 1 freq dqhcprp (6) - 1 freq daffery (7) - 2 freq differn (7) - 1 freq diffren (7) - 1 freq duffer (7) - 6 freq differ (7) - 135 freq differs (7) - 39 freq cfar (8) - 1 freq duffel (8) - 2 freq davcr (8) - 1 freq deffo (8) - 3 freq duffs (8) - 2 freq cfcmod (8) - 1 freq dufners (8) - 1 freq doff (8) - 3 freq scarp (8) - 2 freq carp (8) - 1 freq deform (8) - 1 freq fdfcr (8) - 1 freq daffs (8) - 3 freq dacre (8) - 1 freq doffin (8) - 2 freq ybfqrp (8) - 1 freq deff (8) - 1 freq |
SoundEx code - D212 dispose - 2 freq disposable - 3 freq disposeetion - 3 freq disabuse - 2 freq dispossessed - 2 freq disaffection - 2 freq despise - 5 freq disposed - 2 freq despicable - 2 freq disposition - 2 freq dispositouns - 1 freq despisin - 1 freq dispez - 1 freq despised - 2 freq 'doggy-bug' - 1 freq doggie-bug - 1 freq disposal - 4 freq doughboys - 2 freq duck-face - 1 freq disobeys - 1 freq disposer - 1 freq disavous - 1 freq dispeace - 1 freq despising - 1 freq disfigurement - 1 freq disabused - 2 freq €˜dispose - 1 freq doughbaws - 2 freq disfigured - 1 freq dhsvgcq - 1 freq dsvgwb - 1 freq disaffected - 1 freq dzqbjp - 1 freq dcfcfrp - 1 freq dispassionate - 1 freq dukjbjx - 1 freq dgjfgdqrj - 5 freq dcjfql - 1 freq dzfzxq - 1 freq |
MetaPhone code - TKFKFRP dcfcfrp - 1 freq |
DCFCFRP |
| Time to execute Levenshtein function - 0.240735 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.454703 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.029486 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.076413 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.001127 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. |