Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
petalled (0) - 1 freq pedalled (1) - 1 freq paalled (2) - 1 freq ecalled (2) - 1 freq retailed (2) - 1 freq recalled (2) - 1 freq pettled (2) - 1 freq detailed (2) - 14 freq stalled (2) - 2 freq palled (2) - 5 freq devalled (2) - 1 freq ealled (2) - 1 freq extolled (3) - 1 freq taller (3) - 24 freq petered (3) - 3 freq keilled (3) - 2 freq retained (3) - 2 freq petal (3) - 11 freq tabled (3) - 1 freq healed (3) - 10 freq welled (3) - 1 freq settled (3) - 115 freq swalled (3) - 6 freq enabled (3) - 1 freq delled (3) - 2 freq |
petalled (0) - 1 freq pedalled (2) - 1 freq palled (3) - 5 freq pettled (3) - 1 freq stalled (3) - 2 freq paalled (3) - 1 freq stelled (4) - 8 freq uptailed (4) - 1 freq telled (4) - 2 freq tolled (4) - 1 freq tilled (4) - 3 freq pithailed (4) - 2 freq panelled (4) - 2 freq tallied (4) - 1 freq appalled (4) - 2 freq stilled (4) - 7 freq pilled (4) - 3 freq pulled (4) - 174 freq pallid (4) - 1 freq detailed (4) - 14 freq devalled (4) - 1 freq recalled (4) - 1 freq retailed (4) - 1 freq ecalled (4) - 1 freq ealled (4) - 1 freq |
SoundEx code - P343 piddled - 1 freq paidled - 1 freq pettled - 1 freq puddled - 2 freq paddult - 2 freq peddled - 1 freq paddled - 5 freq paddilt - 2 freq petalled - 1 freq potlatches - 1 freq paidlet - 1 freq pithailed - 2 freq pedalled - 1 freq |
MetaPhone code - PTLT piddled - 1 freq paidled - 1 freq pettled - 1 freq puddled - 2 freq paddult - 2 freq peddled - 1 freq paddled - 5 freq paddilt - 2 freq petalled - 1 freq paidlet - 1 freq pedalled - 1 freq |
PETALLED |
Time to execute Levenshtein function - 0.299678 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.478844 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.030445 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.038819 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. |