| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pittodrie (0) - 16 freq pittodrie's (2) - 1 freq historie (3) - 74 freq victorie (3) - 9 freq tittrin (4) - 1 freq butterie (4) - 7 freq batthrie (4) - 1 freq picture (4) - 178 freq epistolarie (4) - 2 freq toorie (4) - 13 freq histore (4) - 8 freq paitterin (4) - 2 freq poetrie (4) - 17 freq bittersie (4) - 2 freq kittie (4) - 3 freq pittance (4) - 5 freq tittie (4) - 30 freq sindrie (4) - 39 freq priorie (4) - 7 freq bittiie (4) - 1 freq historic (4) - 290 freq litterin (4) - 1 freq chitterie (4) - 1 freq pittert (4) - 1 freq picterin (4) - 1 freq |
pittodrie (0) - 16 freq pittodrie's (4) - 1 freq pitted (5) - 1 freq pitter (5) - 2 freq pittit (6) - 2 freq buttrie (6) - 4 freq pottie (6) - 10 freq petrie (6) - 4 freq pattie (6) - 2 freq gutterie (6) - 1 freq potterin (6) - 3 freq lotterie (6) - 1 freq watterie (6) - 8 freq sitooterie (6) - 3 freq putter (6) - 1 freq pattrin (6) - 1 freq natterie (6) - 1 freq pettie (6) - 1 freq tatterie (6) - 1 freq patterin (6) - 6 freq paitter (6) - 1 freq pittin (6) - 392 freq dotterie (6) - 1 freq puttrin (6) - 1 freq patter (6) - 56 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.187548 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.369311 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.028992 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.037608 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.000918 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. |