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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
request (0) - 28 freq
requests (1) - 7 freq
quest (2) - 18 freq
requestit (2) - 1 freq
requerit (2) - 1 freq
requested (2) - 4 freq
rerrest (2) - 1 freq
requit (2) - 1 freq
frequent (2) - 17 freq
reest (2) - 11 freq
requirt (2) - 1 freq
cheques (3) - 13 freq
reet (3) - 8 freq
greatest (3) - 41 freq
rogues' (3) - 1 freq
racquet (3) - 2 freq
queet (3) - 2 freq
reident (3) - 2 freq
edfest (3) - 3 freq
frequents (3) - 1 freq
raquel (3) - 1 freq
refuses (3) - 17 freq
beegest (3) - 1 freq
neest (3) - 88 freq
reprent (3) - 2 freq
request (0) - 28 freq
requests (2) - 7 freq
requit (3) - 1 freq
requested (3) - 4 freq
requirt (3) - 1 freq
reest (3) - 11 freq
requestit (3) - 1 freq
quest (3) - 18 freq
requerit (3) - 1 freq
refusit (4) - 6 freq
robust (4) - 10 freq
ruist (4) - 1 freq
requirit (4) - 1 freq
erest (4) - 10 freq
repost (4) - 1 freq
reset (4) - 1 freq
ernest (4) - 6 freq
reveesit (4) - 1 freq
ripest (4) - 1 freq
roust (4) - 5 freq
rust (4) - 13 freq
rarest (4) - 4 freq
reist (4) - 8 freq
rest (4) - 683 freq
repast (4) - 1 freq
SoundEx code - R223
resist - 45 freq
request - 28 freq
reseistent - 1 freq
reseistence - 1 freq
re-checked - 1 freq
rashes-the - 1 freq
register - 77 freq
resisted - 2 freq
rejectit - 3 freq
reject - 11 freq
racist - 25 freq
resistance - 28 freq
rejected - 7 freq
rejectin - 4 freq
richest - 7 freq
rejects - 1 freq
rejection - 7 freq
registered - 16 freq
rejeckit - 9 freq
resistit - 2 freq
rejiggit - 2 freq
resisat - 1 freq
registration - 5 freq
rug-sooked - 1 freq
roughest - 3 freq
requested - 4 freq
reichstag - 1 freq
requestit - 1 freq
rejoiced - 3 freq
rejoict - 1 freq
registers - 25 freq
resistin - 1 freq
resistan - 1 freq
resistant - 3 freq
rook-squawked - 1 freq
requests - 7 freq
resisters - 1 freq
register-hooses - 1 freq
registrars - 1 freq
requeishtit - 1 freq
raisistin - 1 freq
registert - 10 freq
€˜registerless - 1 freq
racists - 6 freq
registerin - 3 freq
reegistrar - 1 freq
registrar - 2 freq
resuscitation - 1 freq
rajasthan - 2 freq
recheckit - 1 freq
roughshod - 1 freq
registirs - 1 freq
rechistirs - 1 freq
richist - 1 freq
rechistird - 1 freq
rqzykxd - 1 freq
registry - 1 freq
roguecoder - 3 freq
resuscitated - 1 freq
MetaPhone code - RKST
raxed - 103 freq
request - 28 freq
raxt - 11 freq
raxit - 13 freq
raxd - 1 freq
raxxed - 14 freq
rekksed - 1 freq
rax't - 3 freq
rickste - 1 freq
REQUEST
Time to execute Levenshtein function - 0.196978 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.375778 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.027325 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.037033 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.000871 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.