| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| awgaits (0) - 4 freq aagaits (1) - 2 freq awaits (1) - 8 freq agains (2) - 1 freq waits (2) - 27 freq naegaits (2) - 5 freq await (2) - 7 freq awaites (2) - 1 freq gaits (2) - 30 freq agait (2) - 1 freq agaity (2) - 1 freq €œgaits (2) - 1 freq gants (3) - 1 freq awbeit (3) - 9 freq waith (3) - 2 freq wrait (3) - 6 freq agents (3) - 7 freq swait (3) - 4 freq anits (3) - 2 freq wait (3) - 481 freq plaits (3) - 4 freq swains (3) - 1 freq awaird (3) - 2 freq wains (3) - 13 freq agata (3) - 2 freq |
awgaits (0) - 4 freq awaits (2) - 8 freq aagaits (2) - 2 freq gaits (3) - 30 freq awaites (3) - 1 freq waits (3) - 27 freq awegates (3) - 1 freq naegaits (3) - 5 freq wafts (4) - 8 freq gats (4) - 1 freq agates (4) - 1 freq waists (4) - 3 freq whits (4) - 47 freq waants (4) - 30 freq whats (4) - 18 freq gits (4) - 102 freq wants (4) - 295 freq walts (4) - 1 freq onygaits (4) - 7 freq warts (4) - 5 freq await (4) - 7 freq agait (4) - 1 freq digits (4) - 3 freq agaity (4) - 1 freq wits (4) - 36 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 |
AWGAITS |
| Time to execute Levenshtein function - 0.194975 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.367912 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.028732 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.041206 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.001019 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. |