Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
zsuz (0) - 1 freq zse (2) - 1 freq puz (2) - 1 freq 'sun (2) - 1 freq sud (2) - 92 freq zsk (2) - 1 freq csez (2) - 1 freq soz (2) - 6 freq hsun (2) - 2 freq zz (2) - 6 freq zbu (2) - 1 freq asez (2) - 1 freq bsyz (2) - 1 freq ruz (2) - 3 freq icuz (2) - 1 freq zuaz (2) - 1 freq rauz (2) - 1 freq zhuf (2) - 1 freq siz (2) - 3 freq uz (2) - 50 freq zouk (2) - 1 freq zs (2) - 5 freq wuz (2) - 73 freq zeus (2) - 12 freq guz (2) - 1 freq |
zsuz (0) - 1 freq zsb (3) - 1 freq sz (3) - 5 freq osz (3) - 1 freq zeus (3) - 12 freq zs (3) - 5 freq suez (3) - 13 freq zsl (3) - 1 freq zgz (3) - 1 freq fsz (3) - 1 freq suzy (3) - 24 freq zss (3) - 1 freq sez (3) - 30 freq suze (3) - 1 freq siz (3) - 3 freq nsz (3) - 1 freq zz (3) - 6 freq zsk (3) - 1 freq asez (3) - 1 freq zse (3) - 1 freq soz (3) - 6 freq bsyz (3) - 1 freq zuaz (3) - 1 freq csez (3) - 1 freq csum (4) - 1 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 - SSS sizes - 41 freq susie's - 4 freq syze's - 1 freq suze's - 1 freq sucesso' - 1 freq suzie's - 1 freq zeus's - 3 freq sucess - 1 freq saaces - 1 freq zsuz - 1 freq |
ZSUZ |
Time to execute Levenshtein function - 0.214477 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.362935 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.033650 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.037043 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.000794 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. |