Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
zigzaggy (0) - 1 freq zig-zaggy (1) - 1 freq zigzagged (2) - 1 freq zigzags (2) - 1 freq zigzaggin (2) - 1 freq zigzag (2) - 7 freq zig-zag (3) - 1 freq zig-zaggid (3) - 1 freq shaggy (4) - 2 freq zigged (4) - 1 freq geggy (4) - 2 freq siggy (4) - 2 freq biggy (4) - 1 freq wizzagog (4) - 1 freq zig-zagging (4) - 1 freq biglarry (4) - 1 freq singsangy (4) - 1 freq craggy (4) - 5 freq bigamy (4) - 1 freq zqgtdggf (4) - 1 freq 'maggy (4) - 1 freq signage (4) - 28 freq claggy (4) - 12 freq baggy (4) - 66 freq signally (4) - 2 freq |
zigzaggy (0) - 1 freq zig-zaggy (2) - 1 freq zigzag (3) - 7 freq zigzaggin (3) - 1 freq zigzagged (3) - 1 freq zigzags (3) - 1 freq zig-zaggid (5) - 1 freq zig-zag (5) - 1 freq geggy (6) - 2 freq groggy (6) - 1 freq wizzagog (6) - 1 freq zigged (6) - 1 freq signages (7) - 2 freq giggsy (7) - 24 freq piggy (7) - 17 freq scraggy (7) - 4 freq raggy (7) - 3 freq scroaggy (7) - 1 freq saggy (7) - 1 freq mozgga (7) - 1 freq tgzg (7) - 1 freq wiggly (7) - 3 freq luggage (7) - 3 freq zzg (7) - 1 freq zagged (7) - 2 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 - SKSK zigzag - 7 freq zig-zag - 1 freq zig-zaggy - 1 freq zigzaggy - 1 freq xuxq - 1 freq |
ZIGZAGGY |
Time to execute Levenshtein function - 0.203663 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.351206 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.027831 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.037835 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.000895 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. |