A Corpus of 21st Century Scots Texts

Intro a b c d e f g h i j k l m n o p q r s t u v w x y z Texts Writers Statistics Top200 Search Compare

Levenshtein Distance

Enter a word to find nearest neighbouring words, for example ahint

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to traffek in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
traffek (0) - 3 freq
traffik (1) - 1 freq
traffec (1) - 1 freq
traffeck (1) - 2 freq
treffik (2) - 1 freq
traffic (2) - 50 freq
taffee (2) - 1 freq
traited (3) - 1 freq
trek (3) - 13 freq
graffs (3) - 2 freq
trapped (3) - 24 freq
gaffer (3) - 35 freq
traed (3) - 5 freq
scaffed (3) - 1 freq
traffeckin (3) - 2 freq
spaffer (3) - 1 freq
trak (3) - 3 freq
trark (3) - 1 freq
trawler (3) - 3 freq
traiced (3) - 1 freq
trance (3) - 10 freq
daffed (3) - 3 freq
toffee (3) - 28 freq
toaffay (3) - 1 freq
trailen (3) - 1 freq
traffek (0) - 3 freq
traffik (1) - 1 freq
treffik (2) - 1 freq
traffeck (2) - 2 freq
traffec (2) - 1 freq
traffic (3) - 50 freq
treffic (4) - 1 freq
taffee (4) - 1 freq
truffle (4) - 1 freq
tuffed (5) - 1 freq
giraffe (5) - 12 freq
triefen (5) - 1 freq
tropfen (5) - 1 freq
straff (5) - 2 freq
raffle (5) - 13 freq
traik (5) - 10 freq
taffeta (5) - 1 freq
reffel (5) - 2 freq
track (5) - 129 freq
criffel (5) - 5 freq
toffed (5) - 1 freq
raffie (5) - 1 freq
straffs (5) - 1 freq
tuffet (5) - 2 freq
daffik (5) - 2 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 - 31 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
trivias - 1 freq
throbs - 2 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
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 - TRFK
traffic - 50 freq
traffik - 1 freq
terrific - 2 freq
treffic - 1 freq
traffeck - 2 freq
traffek - 3 freq
treffik - 1 freq
traffec - 1 freq
dervock - 1 freq
trivago - 1 freq
TRAFFEK
Time to execute Levenshtein function - 0.270907 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.441921 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.033221 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.042653 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.001010 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.