Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
peculiarities (0) - 1 freq peculiarities' (1) - 1 freq popularitie (4) - 1 freq specialities (4) - 2 freq celebrities (5) - 3 freq peculators (5) - 1 freq similarities (5) - 8 freq proclivities (5) - 1 freq peculiar (5) - 7 freq seemilarities (5) - 1 freq seimilarities (5) - 1 freq peculiarly (5) - 1 freq solidarities (5) - 1 freq personalities (5) - 3 freq securitie (5) - 3 freq parteecularities (5) - 1 freq parteicularities (5) - 1 freq charities (5) - 4 freq priorities (5) - 19 freq pairities (5) - 1 freq particularities (5) - 6 freq technicalities (5) - 1 freq curiosities (5) - 1 freq speculative (6) - 3 freq declarit (6) - 3 freq |
peculiarities (0) - 1 freq peculiarities' (2) - 1 freq specialities (6) - 2 freq popularitie (6) - 1 freq parteicularities (7) - 1 freq parteecularities (7) - 1 freq charities (7) - 4 freq particularities (7) - 6 freq peculiarly (7) - 1 freq pairities (7) - 1 freq priorities (7) - 19 freq proclivities (7) - 1 freq similarities (7) - 8 freq peculators (7) - 1 freq peculiar (7) - 7 freq seemilarities (7) - 1 freq celebrities (7) - 3 freq seimilarities (7) - 1 freq clartie (8) - 4 freq perties (8) - 7 freq accelerates (8) - 1 freq declares (8) - 5 freq culprits (8) - 2 freq backarties (8) - 3 freq declartin (8) - 1 freq |
SoundEx code - P246 pauchler - 1 freq peculiarities' - 1 freq peculiarities - 1 freq puzzler - 1 freq peculiar - 7 freq pauchlers - 1 freq peculiarly - 1 freq pauchleris - 1 freq |
MetaPhone code - PKLRTS peculiarities' - 1 freq peculiarities - 1 freq |
PECULIARITIES |
Time to execute Levenshtein function - 0.277016 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.479062 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.030051 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.037148 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.000928 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. |