| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| attemptet (0) - 1 freq attemptit (1) - 7 freq attempted (1) - 11 freq attamptat (2) - 1 freq attempt (2) - 81 freq temptet (2) - 1 freq attemptin (2) - 9 freq attempe (2) - 1 freq attempts (2) - 26 freq temptt (3) - 1 freq attestit (3) - 6 freq temptit (3) - 11 freq tempter (3) - 1 freq actseptet (3) - 1 freq attested (3) - 4 freq attemp (3) - 5 freq attimpt (3) - 1 freq attempting (3) - 3 freq attemps (3) - 3 freq tempted (3) - 23 freq attent (4) - 1 freq automatit (4) - 1 freq attimt (4) - 1 freq obtempert (4) - 1 freq attendit (4) - 28 freq |
attemptet (0) - 1 freq attemptit (1) - 7 freq attamptat (2) - 1 freq attempted (2) - 11 freq attempts (3) - 26 freq attemptin (3) - 9 freq attempt (3) - 81 freq temptet (3) - 1 freq temptit (4) - 11 freq attimpt (4) - 1 freq attempe (4) - 1 freq temptt (4) - 1 freq attemp (5) - 5 freq tempted (5) - 23 freq attempting (5) - 3 freq attemps (5) - 3 freq tempter (5) - 1 freq attestit (5) - 6 freq actseptet (5) - 1 freq trumpet (6) - 25 freq pittempton (6) - 3 freq stumpet (6) - 1 freq emptiet (6) - 1 freq emptit (6) - 1 freq tempit (6) - 11 freq |
SoundEx code - A351 attempt - 81 freq attemptit - 7 freq attempts - 26 freq attemps - 3 freq attemptin - 9 freq attempted - 11 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 - ATMPTT attemptit - 7 freq attempted - 11 freq attamptat - 1 freq attemptet - 1 freq |
ATTEMPTET |
| Time to execute Levenshtein function - 0.343448 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.443751 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.027996 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.038535 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.000893 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. |