| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tragic (0) - 17 freq arabic (2) - 7 freq 'magic (2) - 2 freq ragin (2) - 67 freq toapic (2) - 1 freq traid (2) - 3 freq tracin (2) - 8 freq traik (2) - 10 freq ragiy (2) - 1 freq trais (2) - 1 freq tradit (2) - 1 freq rogic (2) - 3 freq train (2) - 147 freq magic (2) - 211 freq trait (2) - 11 freq traui (2) - 1 freq craic (2) - 19 freq tradin (2) - 9 freq trail (2) - 64 freq ragie (2) - 2 freq traffic (2) - 50 freq cragis (2) - 1 freq crags (3) - 7 freq draigit (3) - 2 freq trie (3) - 2 freq |
tragic (0) - 17 freq rogic (3) - 3 freq trig (4) - 41 freq trigly (4) - 6 freq trace (4) - 37 freq tragedy (4) - 19 freq traffic (4) - 50 freq cragis (4) - 1 freq torag (4) - 1 freq trigidy (4) - 1 freq tricia (4) - 2 freq tracey (4) - 22 freq tracy (4) - 13 freq triglie (4) - 1 freq craigyc (4) - 2 freq tragedie (4) - 3 freq trance (4) - 10 freq tregijo (4) - 13 freq ragie (4) - 2 freq trice (4) - 1 freq tradit (4) - 1 freq toapic (4) - 1 freq ragin (4) - 67 freq trais (4) - 1 freq trail (4) - 64 freq |
SoundEx code - T622 traces - 7 freq turkish - 23 freq triggest - 1 freq trackies - 8 freq tragic - 17 freq turquoise - 5 freq terraces - 4 freq targes - 2 freq tarshish - 1 freq torche's - 1 freq trossachs - 8 freq torches - 14 freq tracy's - 1 freq torsos - 1 freq tricycle - 2 freq tregijo - 13 freq 'tregijo - 1 freq 'turkish - 1 freq turkeys - 3 freq trochs - 5 freq turkey's - 1 freq trokes - 1 freq troughs - 4 freq trosky's - 1 freq tresses - 1 freq turkeesh - 1 freq traeces - 1 freq torquoise - 1 freq tharsis - 1 freq tras-os-montes - 1 freq tragically - 2 freq trajectory - 4 freq tragicomic - 1 freq thiriggies - 1 freq turkistan - 2 freq trashcan - 1 freq traceysmith - 1 freq |
MetaPhone code - TRJK tragic - 17 freq |
TRAGIC |
| Time to execute Levenshtein function - 0.221013 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.347409 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.032228 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.039715 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.000977 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. |