| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aqueducts (0) - 1 freq aquaduct (2) - 1 freq aqueous (3) - 1 freq reduces (4) - 1 freq products (4) - 20 freq aspects (4) - 24 freq queues (4) - 9 freq queue's (4) - 1 freq ducts (4) - 4 freq queats (4) - 2 freq adults (4) - 49 freq abduct (4) - 1 freq artefacts (4) - 3 freq avedents (4) - 1 freq queets (4) - 6 freq aquent (4) - 6 freq affects (4) - 9 freq aedies (5) - 1 freq bouets (5) - 1 freq murdochs (5) - 3 freq auldgit (5) - 1 freq arrests (5) - 1 freq aunts (5) - 10 freq hudduck (5) - 2 freq agiements (5) - 1 freq |
aqueducts (0) - 1 freq aquaduct (3) - 1 freq ducts (5) - 4 freq abduct (6) - 1 freq avedents (6) - 1 freq affects (6) - 9 freq wuidcuts (6) - 1 freq queats (6) - 2 freq queets (6) - 6 freq adults (6) - 49 freq aspects (6) - 24 freq products (6) - 20 freq reduces (6) - 1 freq aqueous (6) - 1 freq quilts (7) - 2 freq quinces (7) - 1 freq eediots (7) - 1 freq addict (7) - 1 freq dusts (7) - 2 freq acts (7) - 40 freq quarts (7) - 1 freq fects (7) - 5 freq expects (7) - 6 freq induces (7) - 1 freq eedyits (7) - 1 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 - AKTKTS aqueducts - 1 freq |
AQUEDUCTS |
| Time to execute Levenshtein function - 0.536426 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.705691 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.064251 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.040221 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.000865 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. |