Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
zig-zag (0) - 1 freq zigzag (1) - 7 freq zigzags (2) - 1 freq zig-zaggy (2) - 1 freq zig-zaggid (3) - 1 freq rag-tag (3) - 1 freq zigzaggy (3) - 1 freq highog (4) - 1 freq aigg (4) - 6 freq sing-sang (4) - 4 freq big-buy (4) - 1 freq bizzan (4) - 1 freq rig-bane (4) - 2 freq biggar (4) - 7 freq fizzog (4) - 27 freq mighta (4) - 12 freq i-a (4) - 1 freq ncgvza (4) - 1 freq fit-faw (4) - 1 freq ibiza (4) - 5 freq piazzas (4) - 1 freq signal (4) - 30 freq rig-on (4) - 1 freq jigsas (4) - 2 freq six-page (4) - 1 freq |
zig-zag (0) - 1 freq zigzag (2) - 7 freq zig-zaggy (3) - 1 freq zigzags (4) - 1 freq zigzaggy (5) - 1 freq zig-zaggid (5) - 1 freq rag-tag (5) - 1 freq zzg (6) - 1 freq tgzg (6) - 1 freq zgz (6) - 1 freq rag-bug (6) - 1 freq zondag (7) - 2 freq dug-man (7) - 2 freq fizog (7) - 6 freq gigging (7) - 1 freq pighing (7) - 1 freq igg (7) - 1 freq zip-up (7) - 1 freq gulag (7) - 2 freq bigging (7) - 1 freq zigged (7) - 1 freq zing (7) - 3 freq izzat (7) - 2 freq signage (7) - 28 freq rig-oot (7) - 3 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 |
ZIG-ZAG |
Time to execute Levenshtein function - 0.185706 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.329097 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.027019 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.037741 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.000810 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. |