Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
xlz (0) - 1 freq xhz (1) - 1 freq xxz (1) - 1 freq xl (1) - 3 freq plz (1) - 2 freq lz (1) - 3 freq xz (1) - 4 freq xno (2) - 1 freq xdc (2) - 1 freq xx' (2) - 1 freq ayz (2) - 1 freq clc (2) - 1 freq wxl (2) - 2 freq qlc (2) - 1 freq lx (2) - 3 freq ol (2) - 5 freq qaz (2) - 1 freq alt (2) - 5 freq vlo (2) - 1 freq gtz (2) - 1 freq nz (2) - 5 freq sz (2) - 5 freq xvi (2) - 3 freq xiq (2) - 1 freq zly (2) - 1 freq |
xlz (0) - 1 freq xz (2) - 4 freq plz (2) - 2 freq lz (2) - 3 freq xl (2) - 3 freq xxz (2) - 1 freq xhz (2) - 1 freq klaz (3) - 1 freq oxl (3) - 1 freq xol (3) - 1 freq liz (3) - 71 freq xzo (3) - 1 freq lze (3) - 1 freq ixcz (3) - 1 freq lyz (3) - 1 freq uplz (3) - 1 freq lulz (3) - 1 freq colz (3) - 10 freq xulc (3) - 1 freq axle (3) - 1 freq caz (4) - 2 freq ªla (4) - 2 freq hly (4) - 1 freq old (4) - 178 freq wlk (4) - 1 freq |
SoundEx code - X420 xulc - 1 freq xlz - 1 freq |
MetaPhone code - SLS sowls - 28 freq sls - 8 freq slice - 63 freq seals - 22 freq soles - 17 freq sails - 39 freq solace - 16 freq sauls - 14 freq sales - 32 freq sells - 15 freq slows - 5 freq slaes - 6 freq cells - 17 freq souls - 25 freq sels - 7 freq sluice - 3 freq soul's - 3 freq sowls' - 1 freq sally's - 25 freq sles - 1 freq sail's - 2 freq sayle's - 1 freq zool's - 1 freq solos - 3 freq saul's - 6 freq sallies - 3 freq sleezy - 1 freq sleazy - 1 freq sullies - 3 freq 'slice - 1 freq salsa - 3 freq sulla's - 1 freq cello's - 1 freq sealess - 1 freq saels - 1 freq cell's - 1 freq saulless - 1 freq soals - 1 freq zola's - 1 freq slaws - 1 freq siles - 1 freq salus - 1 freq sals - 1 freq soulless - 3 freq sills - 1 freq zealous - 1 freq sleaze - 2 freq sillos - 1 freq sleeze - 1 freq sloss - 2 freq sillies - 1 freq xlz - 1 freq zils - 1 freq |
XLZ |
Time to execute Levenshtein function - 0.222397 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.404837 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.028979 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.039780 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.000896 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. |