| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pittodrie (0) - 16 freq pittodrie's (2) - 1 freq victorie (3) - 9 freq historie (3) - 74 freq bittiie (4) - 1 freq witterin (4) - 3 freq sindrie (4) - 38 freq pirie (4) - 5 freq kittie (4) - 3 freq poorie (4) - 3 freq patterin (4) - 6 freq aiterie (4) - 1 freq pierie (4) - 8 freq distorit (4) - 1 freq airdrie (4) - 9 freq slitterie (4) - 4 freq epistolarie (4) - 2 freq poetrie (4) - 17 freq splitterie (4) - 1 freq pootherie (4) - 1 freq factorie (4) - 2 freq bittickie (4) - 1 freq pithie (4) - 1 freq litterin (4) - 1 freq atterie (4) - 4 freq |
pittodrie (0) - 16 freq pittodrie's (4) - 1 freq pitter (5) - 2 freq pitted (5) - 1 freq puttrin (6) - 1 freq natterie (6) - 1 freq pattrin (6) - 1 freq patted (6) - 14 freq sitooterie (6) - 3 freq pittance (6) - 4 freq pittit (6) - 2 freq tatterie (6) - 1 freq pittabreid (6) - 1 freq paitterin (6) - 2 freq gutterie (6) - 1 freq watterie (6) - 8 freq pairtnerie (6) - 6 freq pottie (6) - 10 freq pittert (6) - 1 freq pattie (6) - 2 freq potterin (6) - 3 freq pattir (6) - 2 freq putter (6) - 1 freq patter (6) - 53 freq potter (6) - 24 freq |
SoundEx code - P336 pittodrie - 16 freq pettawater - 1 freq pit-ooter - 2 freq peut-etre - 1 freq pittodrie's - 1 freq |
MetaPhone code - PTTR pittodrie - 16 freq pit-ooter - 2 freq peut-etre - 1 freq |
PITTODRIE |
| Time to execute Levenshtein function - 0.193100 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.386244 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.027467 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.037841 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.000838 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. |