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 sonsie

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

Similar words to tribesperson in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
tribesperson (0) - 1 freq
tribespeople (4) - 1 freq
tribesmen (4) - 1 freq
third-person (4) - 6 freq
jamespearson (5) - 3 freq
in-person (5) - 1 freq
spokespersons (5) - 1 freq
grierson (5) - 2 freq
trippers (5) - 2 freq
britherton (6) - 1 freq
disperse (6) - 3 freq
preservin (6) - 8 freq
tripper (6) - 1 freq
kristofferson (6) - 1 freq
scribepedersen (6) - 1 freq
dispersed (6) - 4 freq
emmerson (6) - 1 freq
taibetless (6) - 1 freq
trevellers (6) - 8 freq
triceps (6) - 1 freq
trespass (6) - 3 freq
tresses (6) - 1 freq
tripedog (6) - 9 freq
disperses (6) - 1 freq
dispensin (6) - 2 freq
tribesperson (0) - 1 freq
third-person (7) - 6 freq
tribesmen (7) - 1 freq
tribespeople (7) - 1 freq
transportin (8) - 4 freq
trippers (8) - 2 freq
traispsin (8) - 1 freq
jamespearson (8) - 3 freq
grierson (9) - 2 freq
troopers' (9) - 1 freq
transpires (9) - 1 freq
trespass (9) - 3 freq
troosers (9) - 77 freq
spokespersons (9) - 1 freq
transperent (9) - 1 freq
in-person (9) - 1 freq
tresors (9) - 1 freq
trousers (9) - 12 freq
troopers (9) - 45 freq
transfers (9) - 2 freq
traversin (9) - 1 freq
truipers (9) - 1 freq
tapperon (10) - 1 freq
reservin (10) - 1 freq
reserrin (10) - 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 - 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 - TRBSPRSN
tribesperson - 1 freq
TRIBESPERSON
Time to execute Levenshtein function - 0.288815 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.621443 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.045587 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.040054 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.001189 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.