| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| popular (0) - 1 freq unpopular (4) - 3 freq popularly (4) - 1 freq popular (4) - 100 freq cool (5) - 1 freq star (5) - 1 freq loyal (5) - 1 freq poplars (5) - 2 freq populated (5) - 2 freq repopulate (5) - 1 freq populatit (5) - 1 freq poplar (5) - 1 freq populace (5) - 6 freq popularity (5) - 14 freq tolerare (5) - 1 freq car (5) - 1 freq populate (5) - 3 freq goal (5) - 1 freq unpopulatit (5) - 1 freq powny (5) - 2 freq cone (6) - 2 freq ow (6) - 1 freq polaris (6) - 3 freq deaf (6) - 1 freq pure (6) - 1 freq |
popular (0) - 1 freq powny (8) - 2 freq goal (8) - 1 freq unpopular (8) - 3 freq car (8) - 1 freq tolerare (8) - 1 freq loyal (8) - 1 freq popularly (8) - 1 freq popular (8) - 100 freq cool (8) - 1 freq star (8) - 1 freq glow (9) - 1 freq her (9) - 1 freq rebuilt (9) - 1 freq ither (9) - 1 freq heresir (9) - 1 freq minker (9) - 1 freq tholian (9) - 1 freq tolerate (9) - 1 freq ker (9) - 1 freq person (9) - 1 freq poplar (9) - 1 freq popularity (9) - 14 freq poplars (9) - 2 freq popularised (10) - 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 - PPLR popular - 100 freq poplar - 1 freq popular - 1 freq |
POPULAR |
| Time to execute Levenshtein function - 0.198154 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.365880 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.029777 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.040242 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.000966 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. |