Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
xpxfy (0) - 1 freq ixpxy (2) - 1 freq pxxy (2) - 1 freq lzxy (3) - 1 freq pvf (3) - 1 freq pf (3) - 4 freq xxxxx (3) - 1 freq boxy (3) - 1 freq tuffy (3) - 1 freq psy (3) - 1 freq 'pey (3) - 1 freq pxm (3) - 1 freq huffy (3) - 5 freq czxy (3) - 1 freq foxy (3) - 6 freq bxfb (3) - 1 freq epely (3) - 1 freq upx (3) - 1 freq puy (3) - 3 freq xuxq (3) - 1 freq pray (3) - 145 freq prey (3) - 27 freq exy (3) - 1 freq xtmy (3) - 1 freq pxqz (3) - 2 freq |
xpxfy (0) - 1 freq ixpxy (3) - 1 freq pxxy (4) - 1 freq spoff (5) - 4 freq xx' (5) - 1 freq xxz (5) - 1 freq xoxb (5) - 1 freq poofy (5) - 2 freq xcf (5) - 1 freq opef (5) - 1 freq xxv (5) - 2 freq xxi (5) - 1 freq boxfu (5) - 1 freq px (5) - 1 freq xsx (5) - 1 freq dlxf (5) - 1 freq pfi (5) - 2 freq xplk (5) - 1 freq pxim (5) - 1 freq nxpgf (5) - 1 freq xxix (5) - 1 freq epuf (5) - 1 freq fpxk (5) - 1 freq xxvi (5) - 1 freq xpnv (5) - 1 freq |
SoundEx code - X121 xpxfy - 1 freq xffsf - 1 freq xwpuzjf - 1 freq xpueqkfpe - 1 freq xfzgvjazgd - 1 freq |
MetaPhone code - SPKSF xpxfy - 1 freq |
XPXFY |
Time to execute Levenshtein function - 0.200257 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.450959 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.030307 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.041583 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.000932 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. |