Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
pit-doons (0) - 2 freq pit-doun (2) - 1 freq sit-douns (2) - 1 freq pitdoon (2) - 1 freq cut-doon (3) - 2 freq let-doon (3) - 1 freq pit-oot (3) - 5 freq pit-on (3) - 7 freq rin-doon (3) - 1 freq pit-pony (3) - 1 freq lat-doon (3) - 1 freq sit-doun (3) - 1 freq pit-cowp (4) - 1 freq fit-dunt (4) - 1 freq rig-oots (4) - 2 freq put-on (4) - 1 freq platoons (4) - 2 freq pistons (4) - 2 freq eik-ons (4) - 1 freq shut-doon (4) - 1 freq print-oots (4) - 1 freq pin-point (4) - 1 freq rax-douns (4) - 1 freq pantyloons (4) - 1 freq pot-holes (4) - 1 freq |
pit-doons (0) - 2 freq sit-douns (3) - 1 freq pit-doun (3) - 1 freq pitdoon (4) - 1 freq lat-doon (5) - 1 freq sit-doun (5) - 1 freq pit-on (5) - 7 freq pit-pony (5) - 1 freq let-doon (5) - 1 freq cut-doon (5) - 2 freq pile-ons (6) - 1 freq upthedons (6) - 2 freq petitions (6) - 1 freq pot-holes (6) - 1 freq potions (6) - 11 freq rax-douns (6) - 1 freq patrons (6) - 4 freq put-upon (6) - 1 freq pint-cans (6) - 1 freq pythons (6) - 1 freq put-on (6) - 1 freq rin-doon (6) - 1 freq fit-dunt (6) - 1 freq pit-oot (6) - 5 freq patrones (7) - 1 freq |
SoundEx code - P352 patience - 46 freq putting - 17 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 - 5 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 - PTTNS pit-doons - 2 freq |
PIT-DOONS |
Time to execute Levenshtein function - 0.193241 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.366505 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.027742 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.037460 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.000940 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. |