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 ablow

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

Similar words to terrorists in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
terrorists (0) - 2 freq
terroriss (1) - 1 freq
terrorist (1) - 6 freq
terrorise (2) - 2 freq
terrorism (2) - 3 freq
terrorisin (2) - 1 freq
terrorised (2) - 1 freq
theorists (3) - 1 freq
terrors (3) - 3 freq
trists (4) - 1 freq
arsonists (4) - 1 freq
tortoises (4) - 1 freq
methodists (4) - 1 freq
traists (4) - 1 freq
toorist's (4) - 1 freq
florists (4) - 1 freq
terror (4) - 39 freq
terrifiet (4) - 1 freq
arborist (4) - 1 freq
thrists (4) - 2 freq
kerrots (4) - 1 freq
errors (4) - 7 freq
towerists (4) - 1 freq
terriers (4) - 1 freq
persists (4) - 3 freq
terrorists (0) - 2 freq
terrorist (2) - 6 freq
terroriss (2) - 1 freq
terrorised (4) - 1 freq
terrorisin (4) - 1 freq
terrorism (4) - 3 freq
terrorise (4) - 2 freq
terrors (5) - 3 freq
theorists (5) - 1 freq
towerists (6) - 1 freq
tourists (6) - 57 freq
traists (6) - 1 freq
trists (6) - 1 freq
thrists (6) - 2 freq
terriers (6) - 1 freq
towrists (6) - 8 freq
territories (7) - 5 freq
motorists (7) - 3 freq
theorist (7) - 1 freq
arrests (7) - 1 freq
rerrest (7) - 1 freq
forrests (7) - 1 freq
toorist (7) - 3 freq
trusts (7) - 8 freq
torrents (7) - 3 freq
SoundEx code - T662
terrors - 3 freq
terrorised - 1 freq
terrorisin - 1 freq
triers - 2 freq
terrorist - 6 freq
terrorists - 2 freq
terrorise - 2 freq
terrorism - 3 freq
trark - 1 freq
terroriss - 1 freq
terriers - 1 freq
tear-arsin - 1 freq
thrawers - 1 freq
MetaPhone code - TRRSTS
terrorists - 2 freq
TERRORISTS
Time to execute Levenshtein function - 0.344847 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.346973 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.027179 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.037336 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.000788 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.