| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pirled (0) - 3 freq purled (1) - 1 freq tirled (1) - 6 freq mirled (1) - 2 freq dirled (1) - 11 freq piled (1) - 19 freq pilled (1) - 3 freq birled (1) - 69 freq fired (2) - 61 freq filed (2) - 12 freq birzed (2) - 5 freq skirled (2) - 101 freq titled (2) - 2 freq kirlea (2) - 1 freq killed (2) - 82 freq pied (2) - 4 freq picked (2) - 189 freq willed (2) - 4 freq swirled (2) - 3 freq purfled (2) - 1 freq pirie (2) - 5 freq marled (2) - 2 freq birned (2) - 1 freq giled (2) - 1 freq tirred (2) - 2 freq |
pirled (0) - 3 freq purled (1) - 1 freq birled (2) - 69 freq pilled (2) - 3 freq paroled (2) - 1 freq parlied (2) - 1 freq piled (2) - 19 freq tirled (2) - 6 freq mirled (2) - 2 freq dirled (2) - 11 freq pierced (3) - 11 freq pled (3) - 3 freq parler (3) - 2 freq furled (3) - 11 freq pairked (3) - 1 freq pulled (3) - 174 freq riled (3) - 9 freq puled (3) - 6 freq gurled (3) - 10 freq paired (3) - 1 freq pirlit (3) - 1 freq curled (3) - 44 freq pirated (3) - 1 freq parle (3) - 1 freq parked (3) - 38 freq |
SoundEx code - P643 prelude - 3 freq pairlt - 1 freq pairlit - 1 freq parlied - 1 freq prelates - 2 freq pirlit - 1 freq proletarians - 1 freq proletarian - 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 |
PIRLED |
| Time to execute Levenshtein function - 0.253368 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.408946 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.030093 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.038156 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.000861 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. |