| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pitting (0) - 1 freq patting (1) - 2 freq hitting (1) - 4 freq gitting (1) - 12 freq fitting (1) - 9 freq spitting (1) - 4 freq pittin' (1) - 6 freq pinting (1) - 1 freq putting (1) - 15 freq pittin (1) - 392 freq sitting (1) - 48 freq pattin (2) - 14 freq pottin (2) - 1 freq knitting (2) - 8 freq kittin (2) - 1 freq spittins (2) - 1 freq shitting (2) - 1 freq pitten (2) - 206 freq betting (2) - 2 freq pynting (2) - 1 freq wittings (2) - 1 freq puttin (2) - 58 freq pittinÂ’ (2) - 1 freq pissing (2) - 2 freq pining (2) - 1 freq |
pitting (0) - 1 freq patting (1) - 2 freq putting (1) - 15 freq gitting (2) - 12 freq sitting (2) - 48 freq hitting (2) - 4 freq pinting (2) - 1 freq pittin (2) - 392 freq fitting (2) - 9 freq spitting (2) - 4 freq pittin' (2) - 6 freq getting (3) - 307 freq panting (3) - 3 freq penting (3) - 1 freq puttin' (3) - 1 freq pettin (3) - 3 freq cutting (3) - 16 freq rotting (3) - 1 freq parting (3) - 3 freq pointing (3) - 9 freq letting (3) - 14 freq setting (3) - 14 freq jotting (3) - 6 freq pittan (3) - 13 freq gutting (3) - 1 freq |
SoundEx code - P352 patience - 45 freq putting - 15 freq 'patience - 1 freq potamus - 1 freq pautience - 1 freq photons - 2 freq pudding - 12 freq puddens - 7 freq peden's - 1 freq potions - 11 freq pittance - 4 freq puddins - 13 freq pithiness - 1 freq 'puttin-green - 1 freq pit-doons - 2 freq ptmsd - 1 freq pïttance - 1 freq pudden's - 1 freq 'puttanesca - 1 freq puttanesca - 9 freq puddeens - 1 freq pythons - 1 freq €œpatience - 1 freq patting - 2 freq pitting - 1 freq puddings - 1 freq potemkin - 3 freq podemos - 4 freq paddington - 2 freq patmcclay - 1 freq padding - 3 freq petanque - 1 freq ptncpxbq - 1 freq putinÂ’s - 1 freq ppthomson - 1 freq patmason - 1 freq patnsula - 2 freq |
MetaPhone code - PTNK putting - 15 freq pudding - 12 freq patting - 2 freq pitting - 1 freq padding - 3 freq petanque - 1 freq |
PITTING |
| Time to execute Levenshtein function - 0.225608 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.382903 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.033293 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.039519 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.000827 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. |