Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
populated (0) - 2 freq populate (1) - 3 freq populatit (2) - 1 freq populace (2) - 6 freq popular (3) - 100 freq polluted (3) - 7 freq speculated (3) - 1 freq insulated (3) - 2 freq collated (3) - 1 freq pulsated (3) - 2 freq repopulate (3) - 1 freq modulates (3) - 1 freq amputated (3) - 1 freq popularised (3) - 1 freq operated (3) - 5 freq stipulated (3) - 2 freq sporulate (3) - 1 freq population (3) - 85 freq popularly (3) - 1 freq plated (3) - 3 freq repeated (4) - 32 freq moulded (4) - 2 freq gollared (4) - 1 freq populations (4) - 9 freq poulet (4) - 1 freq |
populated (0) - 2 freq populate (2) - 3 freq populatit (3) - 1 freq polluted (4) - 7 freq population (4) - 85 freq populace (4) - 6 freq plated (4) - 3 freq pelted (5) - 5 freq popularly (5) - 1 freq depleted (5) - 1 freq piloted (5) - 1 freq stipulated (5) - 2 freq populatioun (5) - 1 freq plaited (5) - 3 freq pleated (5) - 5 freq speculated (5) - 1 freq collated (5) - 1 freq operated (5) - 5 freq insulated (5) - 2 freq pulsated (5) - 2 freq popular (5) - 100 freq amputated (5) - 1 freq popularised (5) - 1 freq repopulate (5) - 1 freq potted (6) - 4 freq |
SoundEx code - P143 piebald - 1 freq population - 85 freq populate - 3 freq populations - 9 freq populatit - 1 freq pappled - 2 freq pebbledash - 1 freq peeble-dash - 1 freq populated - 2 freq populatioun - 1 freq |
MetaPhone code - PPLTT populatit - 1 freq populated - 2 freq |
POPULATED |
Time to execute Levenshtein function - 0.246912 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.464643 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.027917 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.038752 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.001088 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. |