Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
defect (0) - 1 freq defects (1) - 1 freq eefect (1) - 1 freq defeat (1) - 30 freq defeck (1) - 1 freq deflect (1) - 2 freq detect (1) - 5 freq deficit (2) - 10 freq deech (2) - 4 freq deeit (2) - 1 freq detects (2) - 1 freq defaut (2) - 20 freq infect (2) - 1 freq deceit (2) - 5 freq defend (2) - 23 freq exect (2) - 1 freq deteck (2) - 1 freq desert (2) - 59 freq detest (2) - 2 freq reject (2) - 11 freq defait (2) - 7 freq effect (2) - 94 freq affect (2) - 10 freq decent (2) - 112 freq deflects (2) - 1 freq |
defect (0) - 1 freq deflect (2) - 2 freq deficit (2) - 10 freq defeck (2) - 1 freq detect (2) - 5 freq defeat (2) - 30 freq defects (2) - 1 freq eefect (2) - 1 freq affect (3) - 10 freq effect (3) - 94 freq deft (3) - 4 freq direct (3) - 53 freq defait (3) - 7 freq delict (3) - 1 freq deceit (3) - 5 freq defaut (3) - 20 freq infect (3) - 1 freq fect (3) - 12 freq definit (4) - 3 freq daft (4) - 436 freq deet (4) - 24 freq edict (4) - 2 freq definet (4) - 1 freq dovecot (4) - 4 freq de-facto (4) - 1 freq |
SoundEx code - D123 deepest - 17 freq deposit - 5 freq devastated - 2 freq dovizdane - 1 freq devisit - 4 freq dipicten - 1 freq deficit - 10 freq devastate - 2 freq deep-seatit - 1 freq divestin - 1 freq defect - 1 freq depicts - 2 freq devistatin - 1 freq deposited - 2 freq depository - 2 freq deep-stowed - 1 freq defects - 1 freq devastation - 3 freq depictit - 4 freq dvstit - 1 freq debased - 1 freq dovecot - 4 freq diffused - 2 freq depiction - 3 freq depictions - 2 freq depicted - 1 freq devastating - 2 freq depositing - 1 freq defecting - 2 freq dubbiest - 1 freq deep-set - 1 freq deepcut - 1 freq devastatit - 1 freq deposits - 3 freq devised - 1 freq difzcidro - 1 freq dpjhodges - 2 freq de-facto - 1 freq dypgt - 1 freq dipstick - 3 freq dipsticks - 1 freq |
MetaPhone code - TFKT defect - 1 freq dovecot - 4 freq de-facto - 1 freq |
DEFECT |
Time to execute Levenshtein function - 0.225281 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.416431 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.028621 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.059171 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.004973 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. |