Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
pitman (0) - 1 freq pieman (1) - 4 freq pittan (1) - 13 freq fitman (1) - 22 freq tman (2) - 1 freq kithan (2) - 1 freq eitan (2) - 1 freq pinkman (2) - 1 freq itan (2) - 1 freq pitten (2) - 207 freq pita (2) - 2 freq pittin (2) - 392 freq fatman (2) - 1 freq i'man (2) - 1 freq pigmen (2) - 1 freq pikan (2) - 2 freq pet-an (2) - 1 freq tinman (2) - 1 freq yit-an (2) - 2 freq pickan (2) - 4 freq cotman (2) - 1 freq oilman (2) - 1 freq titan (2) - 5 freq fitmen (2) - 1 freq sittan (2) - 32 freq |
pitman (0) - 1 freq pieman (2) - 4 freq fitman (2) - 22 freq pittan (2) - 13 freq puttan (3) - 3 freq fitmen (3) - 1 freq batman (3) - 5 freq pet-an (3) - 1 freq cotman (3) - 1 freq penman (3) - 1 freq hatman (3) - 1 freq pigmen (3) - 1 freq pit-on (3) - 7 freq pitin (3) - 1 freq postman (3) - 5 freq pittin (3) - 392 freq tman (3) - 1 freq fatman (3) - 1 freq pitten (3) - 207 freq petten (4) - 7 freq pattin (4) - 16 freq pottin (4) - 1 freq patren (4) - 3 freq autmn (4) - 1 freq teeman (4) - 2 freq |
SoundEx code - P355 pittenweem - 12 freq 'pittenweem - 2 freq piedmontese - 1 freq pitman - 1 freq pitten-on - 1 freq peteonone - 1 freq |
MetaPhone code - PTMN pitman - 1 freq |
PITMAN |
Time to execute Levenshtein function - 0.255490 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.409416 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.033791 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.050046 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.001142 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. |