Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
peebly (0) - 2 freq peely (1) - 19 freq weebly (1) - 1 freq pebbly (1) - 2 freq peeble (1) - 1 freq peerly (1) - 1 freq feebly (1) - 6 freq teeble (2) - 6 freq peesy (2) - 1 freq peeple (2) - 3 freq pebble (2) - 9 freq peel (2) - 41 freq peety (2) - 90 freq seemly (2) - 1 freq reely (2) - 9 freq heely (2) - 1 freq weebay (2) - 1 freq jeelly (2) - 1 freq keenly (2) - 8 freq peebles (2) - 8 freq plenly (2) - 1 freq geegly (2) - 1 freq weekly (2) - 25 freq pueblo (2) - 1 freq needly (2) - 4 freq |
peebly (0) - 2 freq peeble (1) - 1 freq publy (2) - 1 freq pueblo (2) - 1 freq peerly (2) - 1 freq feebly (2) - 6 freq peely (2) - 19 freq pebbly (2) - 2 freq weebly (2) - 1 freq feeble (3) - 10 freq peavly (3) - 4 freq pearly (3) - 5 freq probly (3) - 40 freq pablo (3) - 2 freq peebles (3) - 8 freq pebble (3) - 9 freq peeple (3) - 3 freq teeble (3) - 6 freq peel (3) - 41 freq pbl (3) - 1 freq pally (4) - 12 freq preel (4) - 3 freq paeceably (4) - 2 freq feable (4) - 1 freq puirly (4) - 3 freq |
SoundEx code - P140 people - 587 freq pablo - 2 freq people' - 3 freq papal - 5 freq pupil - 15 freq papple - 1 freq peeple - 3 freq payable - 1 freq pepill - 3 freq peephole - 2 freq pebble - 9 freq pebbly - 2 freq publy - 1 freq pueblo - 1 freq pepil - 2 freq €˜people - 1 freq peebly - 2 freq peeble - 1 freq peepil - 1 freq pfeffel - 1 freq pavel - 1 freq 'people' - 1 freq peavly - 4 freq |
MetaPhone code - PBL pablo - 2 freq pebble - 9 freq pebbly - 2 freq publy - 1 freq pueblo - 1 freq peebly - 2 freq peeble - 1 freq pbl - 1 freq hypobole - 1 freq |
PEEBLY |
Time to execute Levenshtein function - 0.196483 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.350044 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.036812 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.037570 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.000888 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. |