| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| poplars (0) - 2 freq poplar (1) - 1 freq pedlars (2) - 1 freq polar (2) - 24 freq popular (2) - 100 freq powlar (2) - 1 freq poppers (2) - 2 freq collars (2) - 8 freq polaris (2) - 3 freq dollars (2) - 7 freq pillars (2) - 12 freq lowlans (3) - 1 freq spars (3) - 6 freq pools (3) - 19 freq papers (3) - 137 freq poopbags (3) - 1 freq peoples (3) - 13 freq pillaes (3) - 7 freq people's (3) - 14 freq collart (3) - 1 freq plags (3) - 4 freq jolla's (3) - 1 freq spears (3) - 28 freq 'plays (3) - 1 freq powers (3) - 16 freq |
poplars (0) - 2 freq poplar (2) - 1 freq polaris (3) - 3 freq poppers (3) - 2 freq popular (3) - 100 freq pedlars (3) - 1 freq pillars (3) - 12 freq people's (4) - 14 freq popularly (4) - 1 freq splers (4) - 1 freq pillers (4) - 2 freq pipers (4) - 10 freq peelers (4) - 7 freq peppers (4) - 7 freq populous (4) - 1 freq peoples (4) - 13 freq spoilers (4) - 2 freq dollars (4) - 7 freq collars (4) - 8 freq powlar (4) - 1 freq polar (4) - 24 freq appears (4) - 84 freq papers (4) - 137 freq players (5) - 152 freq potless (5) - 1 freq |
SoundEx code - P146 popular - 100 freq poplar - 1 freq poplars - 2 freq popularly - 1 freq popularity - 14 freq popularitie - 1 freq popularisation - 1 freq popularised - 1 freq popular - 1 freq |
MetaPhone code - PPLRS poplars - 2 freq |
POPLARS |
| Time to execute Levenshtein function - 0.589981 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.746091 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.053596 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.048888 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.000992 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. |