| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tapestry (0) - 11 freq tapesty (1) - 1 freq travesty (3) - 2 freq tapes (3) - 11 freq tapert (3) - 2 freq maestro (3) - 3 freq maistry (3) - 1 freq majesty (3) - 79 freq bangstry (3) - 4 freq taest (3) - 1 freq tapster (3) - 6 freq mayesty (3) - 1 freq tapestries (3) - 1 freq taipestrie (3) - 1 freq ancestry (3) - 6 freq wastry (3) - 2 freq papery (3) - 1 freq taests (3) - 1 freq vestry (3) - 3 freq forestry (3) - 8 freq maestly (3) - 5 freq taper (3) - 4 freq meestry (3) - 1 freq tapestried (3) - 1 freq pastry (3) - 9 freq |
tapestry (0) - 11 freq tapesty (2) - 1 freq tapster (3) - 6 freq taipestrie (3) - 1 freq pastry (4) - 9 freq tapestries (4) - 1 freq tapestried (4) - 1 freq tipster (4) - 1 freq pester (5) - 2 freq vestry (5) - 3 freq tasty (5) - 45 freq testy (5) - 1 freq meestry (5) - 1 freq forestry (5) - 8 freq taests (5) - 1 freq taper (5) - 4 freq tapes (5) - 11 freq maestro (5) - 3 freq tapert (5) - 2 freq taupestries (5) - 1 freq maistry (5) - 1 freq wastry (5) - 2 freq taest (5) - 1 freq ancestry (5) - 6 freq industry (6) - 54 freq |
SoundEx code - T123 tippexed - 1 freq twae-faced - 1 freq tapestry - 11 freq taupestries - 1 freq twa-faced - 3 freq top-stories - 1 freq tap-coat - 2 freq teevecheid - 9 freq 'teevecheid - 4 freq teevecheid's - 1 freq typesettin - 1 freq tip-exed - 1 freq tapestries - 1 freq tapster - 6 freq taipestrie - 1 freq tapestried - 1 freq tipster - 1 freq tapcoat - 1 freq tapesty - 1 freq tvosewd - 1 freq tbyjgste - 1 freq tavistockgirl - 1 freq tvzstkkkq - 1 freq tipsywitch - 1 freq tvewqksd - 1 freq thbaketal - 1 freq |
MetaPhone code - TPSTR tapestry - 11 freq depository - 2 freq tapster - 6 freq taipestrie - 1 freq tipster - 1 freq |
TAPESTRY |
| Time to execute Levenshtein function - 0.196332 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.361981 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.035117 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.041227 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.001082 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. |