| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dzqbjp (0) - 1 freq zbji (3) - 1 freq czqbur (3) - 1 freq xgqbp (3) - 1 freq zqij (3) - 1 freq szjjp (3) - 1 freq dqb (3) - 1 freq dzqz (3) - 1 freq zqtj (3) - 2 freq quip (4) - 2 freq equip (4) - 1 freq dubh (4) - 4 freq damij (4) - 1 freq qby (4) - 1 freq ezb (4) - 1 freq bj (4) - 15 freq uuqbwr (4) - 1 freq dubbed (4) - 3 freq dumb (4) - 38 freq dxjw (4) - 1 freq drop (4) - 39 freq droop (4) - 2 freq wqj (4) - 1 freq delboy (4) - 2 freq aqp (4) - 1 freq |
dzqbjp (0) - 1 freq dzqz (6) - 1 freq zqtj (6) - 2 freq dqb (6) - 1 freq szjjp (6) - 1 freq zbji (6) - 1 freq xgqbp (6) - 1 freq czqbur (6) - 1 freq zqij (6) - 1 freq ilzwbja (7) - 1 freq dukjbjx (7) - 1 freq dzyuzj (7) - 1 freq dyqpo (7) - 1 freq zqco (8) - 1 freq debs (8) - 1 freq droap (8) - 11 freq zbma (8) - 1 freq dap (8) - 1 freq drqs (8) - 1 freq nfqbt (8) - 1 freq fzbh (8) - 1 freq doublt (8) - 2 freq sjp (8) - 1 freq qjz (8) - 1 freq diep (8) - 3 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 - TSKBJP dzqbjp - 1 freq |
DZQBJP |
| Time to execute Levenshtein function - 0.219677 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.381277 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.028028 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.037188 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.000839 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. |