| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| attempts (0) - 25 freq attemps (1) - 3 freq attempt (1) - 77 freq attempe (2) - 1 freq tempts (2) - 2 freq attemp (2) - 5 freq attimpt (2) - 1 freq attempted (2) - 10 freq attemptet (2) - 1 freq attemptit (2) - 7 freq attemptin (2) - 9 freq attest (3) - 2 freq attens (3) - 1 freq attamptat (3) - 1 freq accompts (3) - 1 freq atheists (3) - 1 freq tempus (3) - 1 freq attimt (3) - 1 freq attent (3) - 1 freq attends (3) - 1 freq temps (3) - 1 freq tempt (3) - 8 freq €˜tempus (3) - 1 freq attracts (3) - 2 freq artemis (3) - 8 freq |
attempts (0) - 25 freq attempt (2) - 77 freq attemps (2) - 3 freq attemptet (3) - 1 freq attemptit (3) - 7 freq attempted (3) - 10 freq attemptin (3) - 9 freq tempts (3) - 2 freq attimpt (3) - 1 freq attempe (4) - 1 freq attamptat (4) - 1 freq attemp (4) - 5 freq trumpets (5) - 4 freq temptt (5) - 1 freq attimt (5) - 1 freq temps (5) - 1 freq attempting (5) - 3 freq tempt (5) - 8 freq accompts (5) - 1 freq attracts (5) - 2 freq tempus (5) - 1 freq trumps (6) - 8 freq pittempton (6) - 3 freq statements (6) - 19 freq temples (6) - 9 freq |
SoundEx code - A351 attempt - 77 freq attemptit - 7 freq attempts - 25 freq attemps - 3 freq attemptin - 9 freq attempted - 10 freq attenborough - 8 freq attenborough's - 1 freq attamptat - 1 freq attemptet - 1 freq atombomblasta - 1 freq attempe - 1 freq atom-fykie - 1 freq attemp - 5 freq attempting - 3 freq attainable - 2 freq attimpt - 1 freq aidanflynn - 1 freq adambienkov - 1 freq |
MetaPhone code - ATMPTS attempts - 25 freq |
ATTEMPTS |
| Time to execute Levenshtein function - 0.193749 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.511971 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.057589 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.036716 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.000849 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. |