| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| piecemeal (0) - 2 freq piece-bag (3) - 2 freq piece-an (3) - 1 freq piecebag (3) - 1 freq beremeal (3) - 1 freq ogecebel (4) - 1 freq pedestal (4) - 3 freq pierhead (4) - 1 freq piece (4) - 1 freq precedes (4) - 1 freq decimal (4) - 1 freq peecee (4) - 1 freq pieman (4) - 4 freq aitmeal (4) - 2 freq placement (4) - 6 freq preceded (4) - 2 freq mid-meal (4) - 1 freq liegeman (4) - 1 freq paecefil (4) - 1 freq bermeal (4) - 1 freq piece (4) - 357 freq precedent (4) - 6 freq pixcel (4) - 2 freq pierceens (4) - 2 freq peecial (4) - 1 freq |
piecemeal (0) - 2 freq paecefil (5) - 1 freq decimal (5) - 1 freq beremeal (5) - 1 freq peecial (5) - 1 freq piecebag (5) - 1 freq piece-an (5) - 1 freq piece' (6) - 1 freq piecies (6) - 1 freq cereal (6) - 15 freq pieces (6) - 152 freq piecebox (6) - 1 freq halemeal (6) - 2 freq piece- (6) - 2 freq pikemen (6) - 1 freq pickle (6) - 30 freq paeceable (6) - 4 freq paeceably (6) - 2 freq voicemale (6) - 1 freq pommel (6) - 1 freq primal (6) - 3 freq placesaal (6) - 1 freq peaceful (6) - 22 freq pecl (6) - 1 freq pieced (6) - 3 freq |
SoundEx code - P254 piecemeal - 2 freq psml - 23 freq |
MetaPhone code - PSML piecemeal - 2 freq psml - 23 freq |
PIECEMEAL |
| Time to execute Levenshtein function - 0.248791 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.394879 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.028178 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.040449 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.005164 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. |