| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| actoss (0) - 1 freq actors (1) - 31 freq across (1) - 587 freq acoss (1) - 1 freq 'cross (2) - 4 freq actions (2) - 49 freq actor's (2) - 1 freq acts (2) - 43 freq actor (2) - 19 freq factors (2) - 21 freq actes (2) - 1 freq acroos (2) - 1 freq acrose (2) - 1 freq actis (2) - 1 freq closs (2) - 61 freq acroas (2) - 4 freq acroass (2) - 104 freq atoms (2) - 8 freq actors' (2) - 1 freq actress (2) - 24 freq autos (2) - 1 freq acrass (2) - 1 freq toss (2) - 27 freq acorss (2) - 9 freq ac-tors (2) - 1 freq |
actoss (0) - 1 freq across (2) - 587 freq acoss (2) - 1 freq actors (2) - 31 freq toss (3) - 27 freq actress (3) - 24 freq acroass (3) - 104 freq acorss (3) - 9 freq choss (3) - 2 freq ectos (3) - 1 freq acroess (3) - 1 freq closs (3) - 61 freq access (3) - 74 freq cross (3) - 260 freq acrass (3) - 1 freq acts (3) - 43 freq actions (3) - 49 freq actes (3) - 1 freq actis (3) - 1 freq ecosse (4) - 6 freq ects (4) - 4 freq tss (4) - 2 freq toass (4) - 2 freq closse (4) - 1 freq cossy (4) - 1 freq |
SoundEx code - A232 asides - 8 freq acts - 43 freq ashets - 14 freq aside's - 1 freq assets - 15 freq actes - 1 freq auschwitz - 3 freq actseptet - 1 freq actoss - 1 freq aqueducts - 1 freq assauts - 1 freq asda's - 2 freq aagaits - 2 freq aachty-seiven - 1 freq aquaduct - 1 freq actis - 1 freq awegates - 1 freq awgaits - 4 freq agates - 1 freq a-sides - 1 freq ashdouglasscot - 58 freq acidic - 1 freq acids - 1 freq acid-house - 1 freq aichties - 1 freq aquatic - 1 freq astusxp - 1 freq asdas - 1 freq asdaserviceteam - 7 freq agctg - 1 freq agedgoth - 1 freq asdctofndr - 1 freq acdc - 1 freq akidcjnpoo - 1 freq aztecs - 1 freq |
MetaPhone code - AKTS acts - 43 freq actes - 1 freq actoss - 1 freq aagaits - 2 freq actis - 1 freq awgaits - 4 freq agates - 1 freq |
ACTOSS |
| Time to execute Levenshtein function - 0.192453 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.358350 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.027961 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.037694 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.000931 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. |