Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
artifacts (0) - 2 freq artefacts (1) - 3 freq airtifact (2) - 1 freq airtefacts (2) - 1 freq artefact (2) - 3 freq artists (3) - 23 freq artifice (3) - 3 freq attracts (3) - 2 freq cataracts (4) - 1 freq orifices (4) - 1 freq extracts (4) - 3 freq refracts (4) - 1 freq artistes (4) - 2 freq article (4) - 56 freq reacts (4) - 1 freq agitants (4) - 1 freq artisanal (4) - 4 freq antics (4) - 12 freq affects (4) - 9 freq aert-fast (4) - 2 freq architects (4) - 3 freq artist (4) - 25 freq variants (4) - 14 freq litigants (4) - 1 freq antreats (4) - 1 freq |
artifacts (0) - 2 freq artefacts (1) - 3 freq airtefacts (2) - 1 freq airtifact (3) - 1 freq artefact (3) - 3 freq artifice (5) - 3 freq attracts (5) - 2 freq artists (5) - 23 freq astricts (6) - 1 freq airtists (6) - 20 freq €˜facts (6) - 1 freq tracts (6) - 4 freq artificial (6) - 9 freq articles (6) - 23 freq rifts (6) - 6 freq raifts (6) - 1 freq certificates (6) - 3 freq facts (6) - 45 freq 'facts (6) - 1 freq uberfacts (6) - 1 freq prefects (6) - 1 freq orifices (6) - 1 freq affects (6) - 9 freq refracts (6) - 1 freq artistes (6) - 2 freq |
SoundEx code - A631 artefact - 3 freq artefacts - 3 freq ardifuir - 2 freq artificial - 9 freq aertbark - 2 freq airtfae - 1 freq artifacts - 2 freq artifeecial - 6 freq artful - 2 freq airtfoarm - 1 freq aert-fast - 2 freq airtefacts - 1 freq artifeicial - 1 freq airtificial - 1 freq airtpertieleits - 1 freq airtifeecial - 1 freq artifice - 3 freq artificiality - 1 freq airtfu - 1 freq airtifact - 1 freq airtificially - 1 freq arty-ficial - 1 freq aredpov - 1 freq ardbeg - 1 freq artybagger - 1 freq |
MetaPhone code - ARTFKTS artefacts - 3 freq artifacts - 2 freq airtefacts - 1 freq |
ARTIFACTS |
Time to execute Levenshtein function - 0.215737 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.487562 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.032545 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.041149 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.000993 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. |