| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ashets (0) - 14 freq assets (1) - 14 freq ashet (1) - 25 freq ashes (1) - 18 freq washers (2) - 1 freq she's (2) - 1130 freq ases (2) - 1 freq sheus (2) - 1 freq shees (2) - 9 freq asset (2) - 8 freq lashes (2) - 7 freq shots (2) - 21 freq 'she's (2) - 50 freq rashers (2) - 1 freq baskets (2) - 8 freq bashes (2) - 1 freq shits (2) - 3 freq aspects (2) - 24 freq sheets (2) - 69 freq asket (2) - 1 freq nashers (2) - 2 freq washes (2) - 10 freq fashes (2) - 5 freq aches (2) - 10 freq aspekts (2) - 1 freq |
ashets (0) - 14 freq shuts (2) - 13 freq sheets (2) - 69 freq shits (2) - 3 freq shots (2) - 21 freq ashes (2) - 18 freq assets (2) - 14 freq ashet (2) - 25 freq eshes (3) - 6 freq ushers (3) - 2 freq sheps (3) - 1 freq shews (3) - 5 freq sets (3) - 127 freq saets (3) - 29 freq shet (3) - 1 freq whets (3) - 2 freq shoats (3) - 2 freq shites (3) - 8 freq shelts (3) - 13 freq shes (3) - 9 freq ahts (3) - 1 freq sheds (3) - 13 freq shoots (3) - 27 freq shitsu (3) - 1 freq shuits (3) - 4 freq |
SoundEx code - A232 asides - 8 freq acts - 40 freq ashets - 14 freq aside's - 1 freq assets - 14 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 - AXTS ashets - 14 freq aichties - 1 freq |
ASHETS |
| Time to execute Levenshtein function - 0.341280 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.684581 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.027575 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.072421 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.000872 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. |