| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pee-the-bed (0) - 1 freq nettle-bed (4) - 3 freq pee-hee (4) - 1 freq peuthered (4) - 1 freq pish-tha-beds (5) - 1 freq tee-hee (5) - 1 freq bae-the-wye (5) - 1 freq petered (5) - 3 freq gaethered (5) - 1 freq pestered (5) - 1 freq peetied (5) - 3 freq seethed (5) - 1 freq pee-heein (5) - 2 freq blethered (5) - 19 freq weathered (5) - 3 freq heid-the-baw (5) - 4 freq by-the-by (5) - 1 freq leathered (5) - 4 freq tee-he'd (5) - 1 freq rethered (5) - 1 freq re-checked (5) - 1 freq peeterheid (5) - 1 freq peerie-wee (5) - 12 freq up-the-wey (5) - 1 freq lenthened (5) - 1 freq |
pee-the-bed (0) - 1 freq up-the-wey (7) - 1 freq by-the-by (7) - 1 freq peuthered (7) - 1 freq nettle-bed (7) - 3 freq out-the-wey (8) - 1 freq deathbed (8) - 3 freq heid-the-baw (8) - 4 freq bae-the-wye (8) - 1 freq pee-hee (8) - 1 freq pish-tha-beds (8) - 1 freq in-the-wey (8) - 1 freq oot-the-wey (8) - 1 freq see-throwe (9) - 1 freq peterheed (9) - 13 freq petrefied (9) - 1 freq pretended (9) - 11 freq pleitered (9) - 1 freq heathered (9) - 1 freq weel-thoomed (9) - 1 freq dae-tae-day (9) - 1 freq pettahead (9) - 1 freq pit-heid (9) - 1 freq pitheid (9) - 2 freq pithailed (9) - 2 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 - P0BT pee-the-bed - 1 freq |
PEE-THE-BED |
| Time to execute Levenshtein function - 0.235340 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.409902 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.033340 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.048842 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.000962 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. |