| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| traispsin (0) - 1 freq traipsin (1) - 10 freq traipsing (2) - 2 freq traistin (2) - 1 freq graispin (2) - 2 freq traivilin (3) - 1 freq traidin (3) - 2 freq yaissin (3) - 1 freq treisurin (3) - 1 freq teaspuin (3) - 1 freq praisin (3) - 13 freq traists (3) - 1 freq raisistin (3) - 1 freq traipsd (3) - 1 freq translain (3) - 1 freq trainin (3) - 59 freq trashin (3) - 1 freq traversin (3) - 1 freq traivelin (3) - 13 freq taislin (3) - 3 freq grassin (3) - 2 freq traistit (3) - 2 freq taisin (3) - 1 freq rispin (3) - 1 freq trippin (3) - 33 freq |
traispsin (0) - 1 freq traipsin (2) - 10 freq graispin (4) - 2 freq traistin (4) - 1 freq traipsing (4) - 2 freq graspin (5) - 8 freq grassin (5) - 2 freq traversin (5) - 1 freq traipsed (5) - 17 freq tailspin (5) - 1 freq trashin (5) - 1 freq tramplin (5) - 3 freq trappin (5) - 1 freq trippin (5) - 33 freq rispin (5) - 1 freq traipsd (5) - 1 freq treisurin (5) - 1 freq traepin (5) - 2 freq trampin (5) - 15 freq teaspuin (5) - 1 freq traipses (5) - 1 freq raspin (5) - 5 freq traists (5) - 1 freq traipse (5) - 7 freq trampan (6) - 1 freq |
SoundEx code - T621 trespass - 3 freq tree-shaped - 1 freq traispsin - 1 freq tryggvason - 1 freq thoroughfare - 2 freq truchbull - 1 freq thoroughbreeds - 1 freq throch-pit - 4 freq thriegif - 1 freq throughpit - 1 freq through-by - 1 freq thoroughbred - 1 freq tree-covered - 1 freq trochfus - 1 freq traceable - 1 freq tree-covert - 1 freq triceps - 1 freq tyresoff - 1 freq trsve - 1 freq theirishfor - 1 freq trishyb - 1 freq toursfeadan - 1 freq |
MetaPhone code - TRSPSN traispsin - 1 freq |
TRAISPSIN |
| Time to execute Levenshtein function - 0.221047 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.373198 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.027231 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.037604 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.000912 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. |