| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zigzag (0) - 7 freq zigzags (1) - 1 freq zig-zag (1) - 1 freq zigzaggy (2) - 1 freq zgz (3) - 1 freq cigar (3) - 19 freq piggar (3) - 1 freq zigzagged (3) - 1 freq liga' (3) - 1 freq rigg (3) - 7 freq zigged (3) - 1 freq tirzah (3) - 1 freq bizzan (3) - 1 freq izzat (3) - 2 freq ikzxg (3) - 1 freq ligg (3) - 15 freq kitbag (3) - 2 freq wigan (3) - 1 freq izat (3) - 1 freq gigas (3) - 1 freq eigg (3) - 3 freq zigzaggin (3) - 1 freq zig-zaggy (3) - 1 freq pizza (3) - 37 freq zzg (3) - 1 freq |
zigzag (0) - 7 freq zigzags (2) - 1 freq zig-zag (2) - 1 freq zigzaggy (3) - 1 freq tgzg (4) - 1 freq zgz (4) - 1 freq zzg (4) - 1 freq giza (5) - 1 freq eigg (5) - 3 freq highog (5) - 1 freq zigzaggin (5) - 1 freq zig-zaggy (5) - 1 freq zig (5) - 6 freq fizzog (5) - 27 freq aigg (5) - 6 freq zondag (5) - 2 freq fizog (5) - 6 freq zzat (5) - 1 freq signage (5) - 28 freq ligg (5) - 15 freq zigged (5) - 1 freq rigg (5) - 7 freq bigg (5) - 110 freq zigzagged (5) - 1 freq gag (5) - 4 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 |
ZIGZAG |
| Time to execute Levenshtein function - 0.179277 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.349664 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.028494 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.037580 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.001056 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. |