| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| people (0) - 587 freq peoples (1) - 13 freq peopie (1) - 2 freq people' (1) - 3 freq peeple (1) - 3 freq poodle (2) - 3 freq temple (2) - 87 freq people's (2) - 14 freq peoples' (2) - 2 freq propale (2) - 1 freq pele (2) - 17 freq repeople (2) - 3 freq semple (2) - 24 freq pole (2) - 45 freq pimple (2) - 1 freq epple (2) - 13 freq €˜people (2) - 1 freq papple (2) - 1 freq proile (2) - 1 freq pope (2) - 26 freq pebble (2) - 9 freq 'people' (2) - 1 freq soople (2) - 11 freq purple (2) - 110 freq peeble (2) - 1 freq |
people (0) - 587 freq peeple (1) - 3 freq peoples (2) - 13 freq peopie (2) - 2 freq epple (2) - 13 freq people' (2) - 3 freq pope (3) - 26 freq proile (3) - 1 freq papple (3) - 1 freq purple (3) - 110 freq apple (3) - 30 freq pepil (3) - 2 freq peepil (3) - 1 freq ppl (3) - 3 freq peepee (3) - 18 freq peeble (3) - 1 freq soople (3) - 11 freq repeople (3) - 3 freq pele (3) - 17 freq pimple (3) - 1 freq poodle (3) - 3 freq propale (3) - 1 freq pole (3) - 45 freq aipple (3) - 102 freq pearly (4) - 5 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 - PPL people - 587 freq people' - 3 freq papal - 5 freq pupil - 15 freq papple - 1 freq peeple - 3 freq pepill - 3 freq pepil - 2 freq €˜people - 1 freq peepil - 1 freq 'people' - 1 freq |
PEOPLE people - 587 freq peoples - 13 freq peopled - freq dug-people - 9 freq people's - 14 freq people' - 3 freq repeople - 3 freq dugpeople - 2 freq |
| Time to execute Levenshtein function - 0.195355 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.429925 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.043647 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.036640 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.001113 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. |