Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
poot-poot-pootin (0) - 1 freq boom-boom-boomin (6) - 1 freq poot-poot (7) - 2 freq sook-sooksookin (7) - 1 freq oot-o-doors (8) - 1 freq post-lockdoon (8) - 1 freq oot-an-oot (8) - 3 freq oot-and-oot (8) - 1 freq prood-lookin (8) - 1 freq boom-boom-boom (8) - 1 freq ootpittin (8) - 5 freq ootpoorin (8) - 1 freq out-pittin (8) - 1 freq €œoot-patriotic (8) - 1 freq oot-performin (8) - 1 freq stupit-lookin (8) - 1 freq toottootflatoot (9) - 1 freq 'poor-oot' (9) - 1 freq doon-sittin (9) - 1 freq oot-o-th-wei (9) - 1 freq pandrop-sookin (9) - 1 freq doon-lookin (9) - 1 freq oorie-lookin (9) - 1 freq photographin (9) - 1 freq throu-puttin (9) - 1 freq |
poot-poot-pootin (0) - 1 freq poot-poot (11) - 2 freq out-pittin (11) - 1 freq boom-boom-boomin (12) - 1 freq ootpittin (12) - 5 freq stupit-lookin (12) - 1 freq €œoot-patriotic (13) - 1 freq out-spittin (13) - 1 freq pin-pointin (13) - 1 freq p-p-pit (13) - 1 freq oot-performin (13) - 1 freq oot-an-oot (13) - 3 freq pit-a-pat (13) - 1 freq oot-and-oot (13) - 1 freq aff-pittin (14) - 4 freq pickit-lookin (14) - 1 freq forrat-pyntin (14) - 1 freq proportion (14) - 15 freq oot-o-place (14) - 1 freq throu-pittin (14) - 1 freq oot-wuttit (14) - 1 freq photocopyin (14) - 2 freq stoap-motion (14) - 1 freq ten-foot-pole (14) - 1 freq pit-poetry (14) - 1 freq |
SoundEx code - P313 poot-poot-pootin - 1 freq poot-poot - 2 freq phut-phut-phut-phut-phut - 1 freq pit-poetry - 1 freq pathfoot - 1 freq pee-the-bed - 1 freq pit-pat - 2 freq pit-a-pat - 1 freq putbodypartsinfilms - 1 freq ptbt - 1 freq |
MetaPhone code - PTPTPTN poot-poot-pootin - 1 freq |
POOT-POOT-POOTIN |
Time to execute Levenshtein function - 0.628786 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 - 1.274081 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.034180 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.087497 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.000862 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. |