| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| terror (0) - 40 freq tetror (1) - 1 freq terrour (1) - 1 freq terrors (1) - 3 freq error (1) - 16 freq terreg (2) - 1 freq territor (2) - 5 freq herbor (2) - 1 freq terzer (2) - 1 freq nerrer (2) - 2 freq tenior (2) - 1 freq terrie (2) - 2 freq merro (2) - 1 freq terra (2) - 1 freq terre (2) - 1 freq therrr (2) - 1 freq errors (2) - 7 freq tertar (2) - 2 freq terr (2) - 9 freq terrel (2) - 6 freq tenor (2) - 4 freq ferrer (2) - 8 freq horror (2) - 50 freq terry (2) - 16 freq terr' (2) - 1 freq |
terror (0) - 40 freq terrour (1) - 1 freq terrier (2) - 13 freq tetror (2) - 1 freq error (2) - 16 freq terrors (2) - 3 freq horror (3) - 50 freq ferrer (3) - 8 freq terr' (3) - 1 freq terr (3) - 9 freq terrel (3) - 6 freq terrs (3) - 1 freq tarrier (3) - 1 freq tertar (3) - 2 freq errour (3) - 1 freq mirror (3) - 117 freq terry (3) - 16 freq territor (3) - 5 freq terrie (3) - 2 freq terreg (3) - 1 freq nerrer (3) - 2 freq terra (3) - 1 freq terre (3) - 1 freq terzer (3) - 1 freq therrr (3) - 1 freq |
SoundEx code - T660 terrier - 13 freq terror - 40 freq there're - 1 freq thare're - 1 freq thare'r - 1 freq trurh - 1 freq truer - 5 freq terrour - 1 freq thrie-year - 1 freq tarrier - 1 freq thrower - 1 freq turry-wurry - 1 freq three-year - 1 freq truiro - 1 freq |
MetaPhone code - TRR terrier - 13 freq terror - 40 freq dreary - 13 freq drear - 10 freq dearer - 8 freq trurh - 1 freq draaer - 2 freq drier - 9 freq durer - 1 freq draar - 6 freq truer - 5 freq drahr - 1 freq terrour - 1 freq drearie - 1 freq dourer - 2 freq drar - 1 freq tarrier - 1 freq duror - 1 freq truiro - 1 freq draer - 1 freq |
TERROR |
| Time to execute Levenshtein function - 0.185335 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.349913 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.028777 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.043698 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.000915 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. |