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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
fermwarker (0) - 1 freq
rorywalker (4) - 11 freq
firewark (4) - 2 freq
ferrer (4) - 8 freq
remarked (4) - 23 freq
newmarket (4) - 1 freq
forwarded (4) - 2 freq
warker (4) - 7 freq
fermer (4) - 194 freq
fulmmaker (4) - 1 freq
ferrier (4) - 6 freq
berserker (4) - 1 freq
marker (4) - 11 freq
ferm-worker's (4) - 1 freq
embarked (4) - 1 freq
earmarked (4) - 1 freq
fermwife (4) - 17 freq
weaker (5) - 4 freq
fearsamer (5) - 1 freq
firework (5) - 9 freq
rewarded (5) - 2 freq
werker (5) - 2 freq
warked (5) - 23 freq
netwarkin (5) - 1 freq
firewurks (5) - 1 freq
fermwarker (0) - 1 freq
framewark (6) - 10 freq
firewark (6) - 2 freq
framewaark' (7) - 1 freq
firework (7) - 9 freq
fermwife (7) - 17 freq
framewaark (7) - 29 freq
firewirks (7) - 8 freq
firewurks (7) - 1 freq
framewirk (7) - 3 freq
firewirk (7) - 2 freq
fireworks (7) - 11 freq
free-warkin (7) - 1 freq
framework (7) - 7 freq
earmarked (7) - 1 freq
forwarded (7) - 2 freq
ferm-worker's (7) - 1 freq
remarked (7) - 23 freq
ferrer (7) - 8 freq
rorywalker (7) - 11 freq
fermer (7) - 194 freq
warker (7) - 7 freq
marker (7) - 11 freq
fulmmaker (7) - 1 freq
berserker (7) - 1 freq
SoundEx code - F656
fermer's - 21 freq
fermer - 194 freq
framework - 7 freq
fairmer - 65 freq
former - 40 freq
ferm-yerd-while - 1 freq
farmers - 5 freq
formerly - 3 freq
fermyaird-while - 1 freq
fairmers - 38 freq
fermers - 90 freq
fermers' - 3 freq
firmer - 4 freq
forwunnert - 3 freq
ferm-worker's - 1 freq
free-mairket - 1 freq
ferm-yard-while - 1 freq
fairm-yerd - 1 freq
fairmers' - 3 freq
fairmer's - 6 freq
forin'er - 1 freq
forriners - 1 freq
fermyaird - 5 freq
fairm-yard-while - 1 freq
framewark - 10 freq
fernyears - 10 freq
fairmer' - 1 freq
forwaunert - 1 freq
farmer - 9 freq
framewaark - 29 freq
framewaark'' - 1 freq
framewaark' - 1 freq
fairmyaird-while - 1 freq
forwannert - 1 freq
fernyeir - 1 freq
fernyear - 5 freq
farmer's - 3 freq
fairmyaird - 4 freq
farmyaird - 1 freq
furriners - 2 freq
foirhaimmer - 1 freq
framewirk - 3 freq
farmyard - 1 freq
furriner - 1 freq
formartine - 1 freq
fermerdavie - 2 freq
furrener - 1 freq
furreners - 1 freq
furraners - 1 freq
fernyear- - 1 freq
fermwarker - 1 freq
farmersweekly - 9 freq
farnorthscot - 2 freq
formartineutd - 1 freq
freenorthnow - 3 freq
MetaPhone code - FRMWRKR
fermwarker - 1 freq
FERMWARKER
Time to execute Levenshtein function - 0.258412 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.598588 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.028350 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.063877 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.000898 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.