| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| despots (0) - 5 freq depot (2) - 1 freq respons (2) - 1 freq despond (2) - 1 freq despotism (2) - 2 freq despyte (2) - 1 freq despite (2) - 97 freq deserts (2) - 8 freq teapots (2) - 2 freq spots (2) - 29 freq depts (2) - 3 freq dysarts (3) - 1 freq hesps (3) - 2 freq desist (3) - 1 freq peapods (3) - 2 freq desers (3) - 1 freq response (3) - 46 freq tescos (3) - 8 freq weepons (3) - 1 freq despirt (3) - 1 freq despise (3) - 5 freq depicts (3) - 2 freq teapot (3) - 10 freq sprots (3) - 1 freq respects (3) - 8 freq |
despots (0) - 5 freq deserts (3) - 8 freq disputes (3) - 1 freq spots (3) - 29 freq depts (3) - 3 freq despite (3) - 97 freq despyte (3) - 1 freq despotism (3) - 2 freq dispute (4) - 6 freq spits (4) - 24 freq spats (4) - 3 freq spoots (4) - 12 freq dusts (4) - 2 freq dispels (4) - 1 freq dispose (4) - 2 freq despise (4) - 5 freq dists (4) - 1 freq deputes (4) - 1 freq respons (4) - 1 freq dysarts (4) - 1 freq depot (4) - 1 freq teapots (4) - 2 freq despond (4) - 1 freq depth (5) - 22 freq scots (5) - 6761 freq |
SoundEx code - D213 despite - 97 freq despatches - 1 freq despedida - 1 freq dispatched - 4 freq disputin - 8 freq deceivit - 1 freq deespeeoot - 1 freq despots - 5 freq despotick - 1 freq dispute - 6 freq disobedient - 2 freq disputes - 1 freq despotism - 2 freq dissipate - 5 freq disputed - 1 freq deceived - 2 freq dispatches' - 1 freq despyte - 1 freq dispatch - 2 freq dispatchin - 2 freq disputatious - 1 freq dissipatin - 4 freq dogsbody - 1 freq disobedience - 1 freq deceptive - 2 freq disputit - 1 freq deceptively - 1 freq disobeyed - 1 freq despatched - 1 freq duqbtnrju - 1 freq decapitate - 1 freq desfitzpatrick - 7 freq discoveded - 1 freq dspidermanh - 1 freq 'dispute' - 1 freq deasbad - 2 freq dgpatrickmusic - 2 freq dsvvdrr - 1 freq |
MetaPhone code - TSPTS despots - 5 freq disputes - 1 freq |
DESPOTS |
| Time to execute Levenshtein function - 0.187355 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.341115 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.027155 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.037244 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.000841 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. |