| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| attemptit (0) - 7 freq attemptet (1) - 1 freq attemptin (1) - 9 freq attempt (2) - 77 freq attamptat (2) - 1 freq attempting (2) - 3 freq attestit (2) - 6 freq attempted (2) - 10 freq temptit (2) - 11 freq attempts (2) - 25 freq automatit (3) - 1 freq attempe (3) - 1 freq temptin (3) - 10 freq attendit (3) - 28 freq attimpt (3) - 1 freq temptet (3) - 1 freq tempit (3) - 11 freq emptit (3) - 1 freq acceptit (3) - 46 freq attemps (3) - 3 freq attentik (3) - 1 freq attractit (3) - 6 freq temptt (3) - 1 freq attemp (3) - 5 freq steetit (4) - 1 freq |
attemptit (0) - 7 freq attemptet (1) - 1 freq attamptat (2) - 1 freq attemptin (2) - 9 freq attempts (3) - 25 freq temptit (3) - 11 freq attempted (3) - 10 freq attempt (3) - 77 freq attimpt (4) - 1 freq temptet (4) - 1 freq temptt (4) - 1 freq attestit (4) - 6 freq attempting (4) - 3 freq attemps (5) - 3 freq attractit (5) - 6 freq emptit (5) - 1 freq attemp (5) - 5 freq attempe (5) - 1 freq automatit (5) - 1 freq temptin (5) - 10 freq tempit (5) - 11 freq tempert (6) - 2 freq thumpit (6) - 2 freq attributit (6) - 7 freq tempted (6) - 22 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 - ATMPTT attemptit - 7 freq attempted - 10 freq attamptat - 1 freq attemptet - 1 freq |
ATTEMPTIT |
| Time to execute Levenshtein function - 0.193810 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.330476 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.027648 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.037605 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.000785 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. |