| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| purled (0) - 1 freq pursed (1) - 6 freq puled (1) - 6 freq murled (1) - 1 freq pulled (1) - 167 freq gurled (1) - 10 freq purred (1) - 8 freq furled (1) - 11 freq spurled (1) - 1 freq purfled (1) - 1 freq hurled (1) - 20 freq pirled (1) - 3 freq curled (1) - 43 freq burled (1) - 2 freq purned (1) - 1 freq purged (1) - 1 freq paroled (2) - 1 freq pursued (2) - 8 freq pullet (2) - 3 freq pried (2) - 2 freq hurted (2) - 2 freq poured (2) - 28 freq burgled (2) - 2 freq preed (2) - 4 freq parlez (2) - 1 freq |
purled (0) - 1 freq pirled (1) - 3 freq burled (2) - 2 freq purned (2) - 1 freq hurled (2) - 20 freq purged (2) - 1 freq parlied (2) - 1 freq paroled (2) - 1 freq purfled (2) - 1 freq curled (2) - 43 freq spurled (2) - 1 freq pursed (2) - 6 freq puled (2) - 6 freq murled (2) - 1 freq pulled (2) - 167 freq furled (2) - 11 freq purred (2) - 8 freq gurled (2) - 10 freq purlin (3) - 1 freq ruled (3) - 25 freq pawled (3) - 1 freq harled (3) - 6 freq pled (3) - 3 freq parted (3) - 1 freq pulld (3) - 10 freq |
SoundEx code - P643 prelude - 3 freq pairlt - 1 freq pairlit - 1 freq parlied - 1 freq prelates - 2 freq pirlit - 1 freq pirled - 3 freq paralytic - 2 freq prelatioun - 1 freq prelatis - 1 freq €˜paralytics - 1 freq paralytics - 1 freq proletariat - 1 freq pearl-white - 1 freq paroled - 1 freq purled - 1 freq |
MetaPhone code - PRLT prelude - 3 freq pairlt - 1 freq pairlit - 1 freq parlied - 1 freq pirlit - 1 freq pirled - 3 freq paroled - 1 freq purled - 1 freq |
PURLED |
| Time to execute Levenshtein function - 0.222613 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.412013 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.032835 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.041995 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.000791 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. |