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 arrest in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
arrest (0) - 9 freq
arreist (1) - 3 freq
arrests (1) - 1 freq
narrest (1) - 6 freq
armrest (1) - 2 freq
ageest (2) - 2 freq
airnest (2) - 2 freq
agreet (2) - 17 freq
ferest (2) - 1 freq
afresh (2) - 1 freq
forrest (2) - 5 freq
freest (2) - 1 freq
ayres (2) - 1 freq
erest (2) - 10 freq
braest (2) - 1 freq
naurest (2) - 1 freq
ameest (2) - 1 freq
wanrest (2) - 1 freq
arles (2) - 5 freq
attest (2) - 2 freq
allest (2) - 1 freq
barrett (2) - 1 freq
aulest (2) - 7 freq
arrestin (2) - 2 freq
aldest (2) - 1 freq
arrest (0) - 9 freq
arreist (1) - 3 freq
rarest (2) - 4 freq
armrest (2) - 2 freq
arrests (2) - 1 freq
narrest (2) - 6 freq
arras (3) - 24 freq
arrit (3) - 1 freq
sairest (3) - 4 freq
rirst (3) - 1 freq
breest (3) - 23 freq
earnest (3) - 13 freq
prest (3) - 1 freq
fairest (3) - 7 freq
arraes (3) - 1 freq
ferrest (3) - 1 freq
crest (3) - 7 freq
priest (3) - 40 freq
i'rest (3) - 2 freq
reest (3) - 11 freq
forest (3) - 123 freq
rest (3) - 696 freq
ernest (3) - 6 freq
briest (3) - 5 freq
purest (3) - 4 freq
SoundEx code - A623
awricht - 85 freq
awright - 160 freq
argued - 12 freq
aircht - 1 freq
aaricht - 35 freq
arched - 3 freq
arrest - 9 freq
'awright - 4 freq
'awright' - 1 freq
arsed - 19 freq
arctic - 21 freq
'a'richt - 1 freq
a'richt - 8 freq
argied - 22 freq
arrested - 15 freq
airched - 5 freq
aaright - 3 freq
aricht - 71 freq
aristocracy - 5 freq
aright - 7 freq
'aaricht - 3 freq
architecture - 13 freq
architect - 5 freq
aristocratic - 3 freq
aristocrats - 2 freq
argy't - 2 freq
arcades - 2 freq
arcade - 8 freq
arrestit - 7 freq
architectural - 2 freq
airchie'd - 1 freq
awright' - 1 freq
'awricht - 13 freq
'aricht' - 1 freq
airgued - 3 freq
aristius - 1 freq
architects - 3 freq
aroused - 1 freq
airchietectur - 4 freq
arkieteck-gods - 1 freq
arkietecture - 1 freq
archetrave - 1 freq
aristocaat - 1 freq
arcadia - 7 freq
argyed - 1 freq
aristophanes - 3 freq
aristocrat - 1 freq
€˜awright - 8 freq
aa'richt - 1 freq
airgied - 2 freq
aristotlean - 1 freq
arreist - 3 freq
arreistit - 6 freq
aristotle - 1 freq
archetype - 1 freq
archduke - 2 freq
arrestin - 2 freq
airchitect - 1 freq
arra-stickit - 1 freq
arecht - 1 freq
€˜awricht - 1 freq
arrests - 1 freq
ahright - 1 freq
aÂ’right - 1 freq
archied - 1 freq
awericht - 2 freq
aristorcacy - 1 freq
MetaPhone code - ARST
arrest - 9 freq
arsed - 19 freq
aroused - 1 freq
arreist - 3 freq
ARREST
Time to execute Levenshtein function - 0.375743 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.507222 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.079758 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.085777 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.000934 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.