| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| attributit (0) - 7 freq attribution (2) - 1 freq attributed (2) - 1 freq attributes (2) - 5 freq attributive (2) - 2 freq distributit (3) - 1 freq attractit (3) - 6 freq astrictit (3) - 4 freq contributit (3) - 3 freq approbatit (4) - 3 freq contributin (4) - 3 freq retribution (4) - 9 freq attrition (4) - 2 freq distributin (4) - 2 freq attractin (4) - 5 freq athritis (4) - 1 freq attrackit (4) - 1 freq intristit (4) - 1 freq contreibutit (4) - 2 freq tributes (4) - 4 freq tribute (4) - 33 freq attemptit (4) - 7 freq attestit (4) - 6 freq attributively (4) - 1 freq attrakkit (4) - 2 freq |
attributit (0) - 7 freq attribution (3) - 1 freq attributive (3) - 2 freq attributes (3) - 5 freq attributed (3) - 1 freq attractit (4) - 6 freq astrictit (5) - 4 freq contributit (5) - 3 freq distributit (5) - 1 freq tribute (6) - 33 freq contreibutit (6) - 2 freq attemptit (6) - 7 freq attributively (6) - 1 freq attrakkit (6) - 2 freq intristit (6) - 1 freq attestit (6) - 6 freq tributes (6) - 4 freq retribution (6) - 9 freq attrackit (6) - 1 freq attrition (6) - 2 freq approbatit (6) - 3 freq attractin (6) - 5 freq garbutt (7) - 1 freq attracts (7) - 2 freq attract (7) - 7 freq |
SoundEx code - A361 adrift - 9 freq atrophy - 1 freq adorable - 8 freq attributes - 5 freq ati'rubbir - 1 freq attributive - 2 freq attributively - 1 freq attributit - 7 freq attributed - 1 freq attribution - 1 freq authorpetermay - 2 freq atarbuck - 1 freq |
MetaPhone code - ATRBTT attributit - 7 freq attributed - 1 freq |
ATTRIBUTIT |
| Time to execute Levenshtein function - 0.193831 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.363781 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.030334 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.042271 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.000911 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. |