| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xuxq (0) - 1 freq nuxh (2) - 1 freq xxxk (2) - 1 freq xua (2) - 2 freq xxm (2) - 1 freq xzx (2) - 1 freq xox (2) - 2 freq xix (2) - 1 freq xoxb (2) - 1 freq lxq (2) - 1 freq ux (2) - 3 freq fux (2) - 1 freq xiq (2) - 1 freq xulc (2) - 1 freq xsx (2) - 1 freq uq (2) - 2 freq xut (2) - 1 freq hrxq (2) - 1 freq xmxm (2) - 1 freq xxi (2) - 1 freq xxz (2) - 1 freq xxxx (2) - 3 freq xlnq (2) - 1 freq xuc (2) - 1 freq murq (2) - 1 freq |
xuxq (0) - 1 freq xxz (3) - 1 freq xiq (3) - 1 freq xxi (3) - 1 freq xxx (3) - 486 freq xx' (3) - 1 freq xq (3) - 2 freq lxq (3) - 1 freq xoxb (3) - 1 freq xx (3) - 79 freq afxq (3) - 1 freq xvq (3) - 1 freq xxm (3) - 1 freq xxv (3) - 2 freq xix (3) - 1 freq xox (3) - 2 freq xxg (3) - 1 freq uaq (4) - 1 freq muxh (4) - 1 freq xuaj (4) - 1 freq dux (4) - 3 freq tux (4) - 1 freq utq (4) - 2 freq xqu (4) - 2 freq exxm (4) - 1 freq |
SoundEx code - X200 xix - 1 freq xxix - 1 freq xox - 2 freq xhoc - 1 freq xuxq - 1 freq xhz - 1 freq xsoj - 1 freq xwgo - 1 freq xoiwz - 1 freq xehws - 1 freq xwix - 1 freq xejay - 1 freq xywuj - 1 freq xiq - 1 freq xuc - 1 freq xuaj - 1 freq xhs - 1 freq xhg - 1 freq |
MetaPhone code - SKSK zigzag - 7 freq zig-zag - 1 freq zig-zaggy - 1 freq zigzaggy - 1 freq xuxq - 1 freq |
XUXQ |
| Time to execute Levenshtein function - 0.200463 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.330116 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.028017 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.037272 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.000960 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. |