| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| teampeepee (0) - 9 freq teaspeen (4) - 1 freq teepee (4) - 5 freq tempered (4) - 3 freq temperate (4) - 3 freq peepee (4) - 18 freq twa-piece (5) - 1 freq realeesed (5) - 1 freq tramp-like (5) - 1 freq gettkeeper (5) - 1 freq tempers (5) - 2 freq temperit (5) - 1 freq trapple (5) - 3 freq peewee (5) - 1 freq peeppeeps (5) - 1 freq tea-weel (5) - 1 freq temptised (5) - 1 freq temple (5) - 86 freq eeeeeeeee (5) - 1 freq eeeeeeeeee (5) - 1 freq peeeeeeee (5) - 2 freq peeeeeee (5) - 1 freq teacheen (5) - 1 freq trample (5) - 2 freq peeeeee (5) - 2 freq |
teampeepee (0) - 9 freq timpeake (6) - 2 freq tamped (6) - 1 freq temper (6) - 50 freq tamper (6) - 1 freq teaspeen (6) - 1 freq temple (6) - 86 freq tempered (6) - 3 freq teepee (6) - 5 freq peepee (6) - 18 freq temperate (6) - 3 freq trapped (7) - 24 freq tempter (7) - 1 freq trapeze (7) - 1 freq temples (7) - 9 freq mappie (7) - 20 freq tramped (7) - 11 freq template (7) - 6 freq taxpeyer (7) - 1 freq treeple (7) - 1 freq teamie (7) - 1 freq teleseope (7) - 1 freq temptet (7) - 1 freq teamed (7) - 1 freq amputee (7) - 2 freq |
SoundEx code - T511 twennyfive - 1 freq teampeepee - 9 freq tomboyoptional - 5 freq |
MetaPhone code - TMPP teampeepee - 9 freq |
TEAMPEEPEE |
| Time to execute Levenshtein function - 0.777036 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.820115 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.085967 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.109843 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.000881 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. |