| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| plainly (0) - 9 freq plinky (2) - 15 freq glarinly (2) - 1 freq paisly (2) - 1 freq plaine (2) - 1 freq plinty (2) - 32 freq plainer (2) - 3 freq wainly (2) - 1 freq plainit (2) - 1 freq vainly (2) - 3 freq mainly (2) - 40 freq plains (2) - 4 freq plain's (2) - 1 freq 'ainly (2) - 3 freq clairly (2) - 2 freq blinly (2) - 2 freq glaidly (2) - 2 freq ainly (2) - 231 freq plaint (2) - 1 freq plenly (2) - 1 freq plain (2) - 178 freq fainly (2) - 2 freq lain (3) - 18 freq linky (3) - 2 freq gladly (3) - 7 freq |
plainly (0) - 9 freq plenly (2) - 1 freq plains (3) - 4 freq blinly (3) - 2 freq plaint (3) - 1 freq plinky (3) - 15 freq plainit (3) - 1 freq plain (3) - 178 freq plaine (3) - 1 freq plainer (3) - 3 freq plinty (3) - 32 freq plan (4) - 236 freq plaens (4) - 1 freq pally (4) - 12 freq plant (4) - 82 freq plaunt (4) - 2 freq lanely (4) - 33 freq playins (4) - 1 freq pilly (4) - 1 freq paill (4) - 1 freq lonly (4) - 2 freq plyin (4) - 1 freq playing (4) - 58 freq planed (4) - 1 freq planer (4) - 1 freq |
SoundEx code - P454 plainly - 9 freq pell-mell - 2 freq poulmoleen - 1 freq palmolive - 1 freq plenly - 1 freq philomela - 3 freq paulmalgrati - 8 freq |
MetaPhone code - PLNL plainly - 9 freq plenly - 1 freq |
PLAINLY |
| Time to execute Levenshtein function - 0.238642 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.423061 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.031670 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.038058 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.000981 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. |