Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tarriffs (0) - 1 freq turriff (2) - 1 freq terriers (3) - 1 freq bailiffs (3) - 1 freq earrins (3) - 2 freq harriers (3) - 2 freq tarrier (3) - 1 freq tartuffe (3) - 15 freq carrie's (3) - 1 freq larries (3) - 8 freq parrifen (3) - 1 freq tarrible (3) - 7 freq yarries (3) - 1 freq tarrie (3) - 2 freq earrings (3) - 7 freq barriers (3) - 6 freq tardis (3) - 2 freq garrins (3) - 1 freq marris (3) - 2 freq barries (3) - 1 freq cardiff (3) - 1 freq carries (3) - 10 freq tirricks (3) - 5 freq tarrin (3) - 1 freq terrify (3) - 1 freq |
tarriffs (0) - 1 freq turriff (3) - 1 freq tirricks (5) - 5 freq tartuffe (5) - 15 freq terrific (5) - 2 freq terriers (5) - 1 freq terrify (5) - 1 freq graffs (6) - 2 freq terrors (6) - 3 freq reiffis (6) - 1 freq take-offs (6) - 1 freq terrifyin (6) - 12 freq straffs (6) - 1 freq myturriff (6) - 1 freq torrs (6) - 2 freq triffles (6) - 1 freq tirrivies (6) - 1 freq torrents (6) - 3 freq terrifiet (6) - 1 freq terrs (6) - 1 freq terrifeet (6) - 2 freq toffs (6) - 13 freq terrifyan (6) - 3 freq triffils (6) - 2 freq turra's (6) - 1 freq |
SoundEx code - T612 threips - 10 freq tribes - 24 freq traipsin - 10 freq threaps - 56 freq traipsed - 17 freq traipse - 7 freq troops - 67 freq turbos - 2 freq troops' - 1 freq traffic - 50 freq tropical - 6 freq trev's - 14 freq 'trev's - 1 freq traipsd - 1 freq trips - 30 freq turps - 2 freq trevis - 1 freq trophies - 5 freq thrabs - 1 freq traps - 12 freq threips's - 1 freq traffic--jammed - 1 freq trip's - 3 freq tryp's - 1 freq trapie's - 1 freq traffik - 1 freq terrific - 2 freq therapies - 2 freq tarriffs - 1 freq travesty - 2 freq tarbuck - 1 freq thrip-stane - 1 freq tarves - 8 freq terpsichore - 1 freq turfs - 1 freq traeps - 1 freq treffic - 1 freq trapeze - 1 freq traffeckin - 2 freq traffeck - 2 freq tirrivies - 1 freq travaigan - 1 freq tirvs - 1 freq three-piece - 4 freq træpsis - 1 freq throbs - 1 freq thrives - 3 freq turbo-skites - 1 freq three-pace - 1 freq trövies - 1 freq terrificaation - 1 freq tropics - 2 freq tirrivees - 1 freq tripes - 1 freq traipses - 1 freq teerification - 1 freq truips - 5 freq traffek - 3 freq terrificautioun - 1 freq treffik - 1 freq traffec - 1 freq terrification - 2 freq tribesperson - 1 freq tribespeople - 1 freq troves - 1 freq tear-begrutten - 1 freq thrawback - 2 freq therapist - 1 freq tribesmen - 1 freq traipsing - 2 freq turves - 1 freq throwback - 2 freq truefact - 1 freq teribus - 1 freq trafficscotland - 2 freq tarvesmin - 1 freq toryfiasco - 1 freq tyrebagger - 1 freq tripeuk - 22 freq tripceol - 1 freq trivago - 1 freq throwbackthursday - 1 freq terfs - 1 freq trevshan - 1 freq |
MetaPhone code - TRFS droves - 10 freq drives - 27 freq trev's - 14 freq 'trev's - 1 freq trevis - 1 freq trophies - 5 freq tarriffs - 1 freq drive's - 1 freq tarves - 8 freq turfs - 1 freq tirrivies - 1 freq tirvs - 1 freq troughs - 4 freq drivas - 1 freq derives - 10 freq trövies - 1 freq tirrivees - 1 freq troves - 1 freq turves - 1 freq terfs - 1 freq |
TARRIFFS |
Time to execute Levenshtein function - 0.220793 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.400942 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.030148 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.046292 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.000866 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. |