| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ziege (0) - 1 freq liege (1) - 4 freq siege (1) - 7 freq hiegh (2) - 2 freq nidge (2) - 2 freq vieve (2) - 14 freq piee (2) - 1 freq ginge (2) - 3 freq fidge (2) - 9 freq binge (2) - 4 freq ege (2) - 4 freq dirge (2) - 5 freq pege (2) - 2 freq giese (2) - 2 freq singe (2) - 3 freq iece (2) - 1 freq wiegt (2) - 1 freq vaege (2) - 3 freq aige (2) - 11 freq sieve (2) - 6 freq hege (2) - 2 freq niece (2) - 11 freq hinge (2) - 5 freq midge (2) - 10 freq liefe (2) - 1 freq |
ziege (0) - 1 freq siege (2) - 7 freq zig (2) - 6 freq liege (2) - 4 freq aidge (3) - 5 freq riage (3) - 1 freq hege (3) - 2 freq uisge (3) - 5 freq aige (3) - 11 freq viage (3) - 1 freq diego (3) - 3 freq zg (3) - 6 freq zeke (3) - 1 freq vaege (3) - 3 freq zine (3) - 2 freq zing (3) - 3 freq inge (3) - 1 freq pege (3) - 2 freq ege (3) - 4 freq zag (3) - 7 freq zeus (4) - 12 freq usige (4) - 1 freq jeeg (4) - 1 freq agee (4) - 1 freq image (4) - 102 freq |
SoundEx code - Z200 zis - 2 freq zouk - 1 freq zig - 6 freq zag - 7 freq zac - 4 freq 'zac' - 1 freq zak - 4 freq zowk - 1 freq zeus - 12 freq zeus's - 3 freq ziska - 1 freq zoos - 2 freq ziege - 1 freq zxkuc - 1 freq zqhos - 1 freq zqij - 1 freq zeke - 1 freq zcccyg - 1 freq zehoc - 1 freq zuaz - 1 freq zqzzejo - 1 freq zqyk - 1 freq zijc - 1 freq zys - 1 freq zzhq - 1 freq zhws - 1 freq zsuz - 1 freq zico - 1 freq zkcgiq - 1 freq zchiz - 1 freq zoioigaa - 1 freq |
MetaPhone code - SJ sage - 9 freq siege - 7 freq sadge - 1 freq seej - 1 freq seige - 1 freq sedge - 1 freq saige - 3 freq ziege - 1 freq xja - 1 freq sjao - 1 freq sjw - 1 freq xji - 1 freq xejay - 1 freq sij - 2 freq xju - 1 freq xje - 1 freq sj - 2 freq xjuiu - 1 freq zje - 1 freq zj - 1 freq xuaj - 1 freq |
ZIEGE |
| Time to execute Levenshtein function - 0.358497 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.783203 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.039045 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.095076 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.001277 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. |