| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zxkuc (0) - 1 freq xuc (2) - 1 freq rxruc (2) - 1 freq zx (3) - 1 freq zulu (3) - 2 freq zehoc (3) - 1 freq ksc (3) - 1 freq zntu (3) - 1 freq zwtc (3) - 1 freq zouk (3) - 1 freq gokc (3) - 1 freq xju (3) - 1 freq uc (3) - 2 freq phknc (3) - 1 freq xua (3) - 2 freq kxiac (3) - 1 freq xut (3) - 1 freq luc (3) - 28 freq wbkuy (3) - 1 freq zukt (3) - 1 freq zdxc (3) - 1 freq kmc (3) - 2 freq exufc (3) - 1 freq xgrc (3) - 1 freq xk (3) - 1 freq |
zxkuc (0) - 1 freq rxruc (4) - 1 freq xuc (4) - 1 freq xdc (5) - 1 freq zxd (5) - 1 freq uxoc (5) - 1 freq fxkqu (5) - 1 freq zk (5) - 3 freq zebwc (5) - 1 freq zsk (5) - 1 freq xkd (5) - 1 freq ixsc (5) - 1 freq rxc (5) - 1 freq fxc (5) - 1 freq zak (5) - 4 freq zxst (5) - 1 freq xulc (5) - 1 freq xc (5) - 2 freq xzc (5) - 1 freq xhoc (5) - 1 freq bkc (5) - 1 freq zvkwic (5) - 1 freq xkg (5) - 1 freq zxcb (5) - 1 freq ixgc (5) - 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 - SKSKK zxkuc - 1 freq |
ZXKUC |
| Time to execute Levenshtein function - 0.195871 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.364406 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.027984 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.037533 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.000870 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. |