| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| attempt (0) - 81 freq attemp (1) - 5 freq attempts (1) - 26 freq attemps (1) - 3 freq attempe (1) - 1 freq attimpt (1) - 1 freq attest (2) - 2 freq attemptit (2) - 7 freq attemptin (2) - 9 freq attimt (2) - 1 freq attempted (2) - 11 freq tempt (2) - 9 freq attemptet (2) - 1 freq attent (2) - 1 freq asteep (3) - 2 freq attendit (3) - 28 freq atterie (3) - 4 freq sattelt (3) - 12 freq attestit (3) - 6 freq atter (3) - 1 freq steemt (3) - 1 freq attecks (3) - 1 freq wattert (3) - 5 freq attacht (3) - 1 freq ettelt (3) - 13 freq |
attempt (0) - 81 freq attimpt (1) - 1 freq attemps (2) - 3 freq attempe (2) - 1 freq attempts (2) - 26 freq attemp (2) - 5 freq tempt (3) - 9 freq attemptet (3) - 1 freq attempted (3) - 11 freq attemptin (3) - 9 freq attimt (3) - 1 freq attemptit (3) - 7 freq stampt (4) - 4 freq tempit (4) - 11 freq stumpt (4) - 1 freq attamptat (4) - 1 freq trampt (4) - 2 freq attent (4) - 1 freq attest (4) - 2 freq teemt (5) - 3 freq accompt (5) - 2 freq thumpit (5) - 2 freq trumpat (5) - 1 freq trumpet (5) - 25 freq tattert (5) - 4 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 - ATMPT attempt - 81 freq attimpt - 1 freq |
ATTEMPT |
| Time to execute Levenshtein function - 0.264203 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.555245 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.040196 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.037493 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.000866 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. |