| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zacchaeus (0) - 8 freq ascraeus (3) - 2 freq bacchus (3) - 1 freq alphaeus (3) - 1 freq alcaeus (3) - 1 freq hatchets (4) - 1 freq cheus (4) - 6 freq taichers (4) - 2 freq alchies (4) - 1 freq faichers (4) - 1 freq caucasus (4) - 1 freq marches (4) - 16 freq backhaun (4) - 1 freq accause (4) - 9 freq hatches (4) - 4 freq taiches (4) - 1 freq archie's (4) - 14 freq saccharin (4) - 1 freq bacchanal (4) - 1 freq archaeo (4) - 1 freq laachters (4) - 1 freq hauchles (4) - 1 freq lauches (4) - 1 freq arches (4) - 17 freq watchers (4) - 11 freq |
zacchaeus (0) - 8 freq bacchus (4) - 1 freq accies (6) - 2 freq latches (6) - 2 freq aches (6) - 10 freq watchees (6) - 1 freq matches (6) - 41 freq arches (6) - 17 freq accuses (6) - 1 freq access (6) - 74 freq ratches (6) - 1 freq patches (6) - 22 freq vaccines (6) - 4 freq daiches (6) - 2 freq couches (6) - 2 freq watches (6) - 29 freq acceps (6) - 1 freq lauches (6) - 1 freq catches (6) - 34 freq coaches (6) - 9 freq echaes (6) - 2 freq marches (6) - 16 freq accause (6) - 9 freq hatches (6) - 4 freq caucasus (6) - 1 freq |
SoundEx code - Z220 zigzag - 7 freq zacchaeus - 8 freq zig-zag - 1 freq zigzags - 1 freq zig-zaggy - 1 freq zigzaggy - 1 freq |
MetaPhone code - SKXS scotia's - 16 freq sketches - 4 freq scotchies - 11 freq zacchaeus - 8 freq scutches - 1 freq |
ZACCHAEUS |
| Time to execute Levenshtein function - 0.219580 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.378713 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.027284 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.037422 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.000953 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. |