| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| terrier (0) - 13 freq verrier (1) - 1 freq terrie (1) - 2 freq merrier (1) - 4 freq tarrier (1) - 1 freq ferrier (1) - 6 freq terriers (1) - 1 freq cerrier (1) - 1 freq herries (2) - 4 freq terrify (2) - 1 freq tarrie (2) - 2 freq herriet (2) - 4 freq serried (2) - 1 freq terror (2) - 39 freq ferrer (2) - 8 freq kerrie (2) - 1 freq aerlier (2) - 8 freq merrie (2) - 7 freq terrel (2) - 6 freq terminer (2) - 2 freq terre (2) - 1 freq terrile (2) - 1 freq peerier (2) - 17 freq kerries (2) - 8 freq merries (2) - 6 freq |
terrier (0) - 13 freq tarrier (1) - 1 freq cerrier (2) - 1 freq terriers (2) - 1 freq terror (2) - 39 freq terrour (2) - 1 freq ferrier (2) - 6 freq verrier (2) - 1 freq terrie (2) - 2 freq merrier (2) - 4 freq earrier (3) - 1 freq terre (3) - 1 freq farrier (3) - 2 freq terrile (3) - 1 freq barrier (3) - 13 freq territor (3) - 5 freq furrier (3) - 1 freq nerrer (3) - 2 freq carrier (3) - 15 freq harrier (3) - 2 freq terreg (3) - 1 freq tarrie (3) - 2 freq terrify (3) - 1 freq terzer (3) - 1 freq terrel (3) - 6 freq |
SoundEx code - T660 terrier - 13 freq terror - 39 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 - 39 freq dreary - 13 freq drear - 10 freq dearer - 8 freq trurh - 1 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 draaer - 1 freq truiro - 1 freq draer - 1 freq |
TERRIER |
| Time to execute Levenshtein function - 0.387507 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.732240 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.080059 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.097302 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.001086 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. |