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 fore-door in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
fore-door (0) - 7 freq
forenoon (3) - 6 freq
freoor (3) - 1 freq
fower-oor (3) - 1 freq
holo-door (3) - 4 freq
forestor (3) - 1 freq
front-door (3) - 3 freq
forecoort (3) - 2 freq
face-doon (3) - 2 freq
dreidour (4) - 1 freq
forever (4) - 72 freq
far-oot (4) - 1 freq
fore'er (4) - 1 freq
outdoor (4) - 7 freq
holodoor (4) - 1 freq
forefolk (4) - 2 freq
freedoms (4) - 13 freq
forefowk (4) - 9 freq
fore-erm (4) - 4 freq
forebear (4) - 3 freq
sour-dook (4) - 1 freq
foredaw (4) - 2 freq
forenoons (4) - 1 freq
four-foot (4) - 1 freq
worn-oot (4) - 2 freq
fore-door (0) - 7 freq
face-doon (5) - 2 freq
forder (5) - 95 freq
forestor (5) - 1 freq
front-door (5) - 3 freq
freoor (5) - 1 freq
holo-door (5) - 4 freq
fower-oor (5) - 1 freq
face-doun (6) - 3 freq
ordour (6) - 2 freq
rae-deer (6) - 1 freq
forordnar (6) - 2 freq
furder (6) - 53 freq
foreigner (6) - 4 freq
fredome (6) - 1 freq
fore-paas (6) - 1 freq
forty-four (6) - 1 freq
fordoun (6) - 3 freq
forester (6) - 3 freq
oradour (6) - 1 freq
foreswore (6) - 1 freq
mordor (6) - 2 freq
ferder (6) - 10 freq
free-er (6) - 1 freq
ferdir (6) - 1 freq
SoundEx code - F636
forthricht - 2 freq
forder - 95 freq
further - 157 freq
furder - 53 freq
farther - 14 freq
firther - 1 freq
forders - 8 freq
fairtricket - 1 freq
fordersome - 1 freq
furtherin - 1 freq
farder - 31 freq
firetrap - 2 freq
furthering - 2 freq
fraternity - 6 freq
farter - 1 freq
fritters - 4 freq
fritter - 21 freq
furdèr - 1 freq
ferdir - 1 freq
ferder - 10 freq
fortranslation - 1 freq
forderance - 2 freq
fortress - 6 freq
fritterin - 1 freq
farthermost - 1 freq
frederick - 4 freq
fordèr - 46 freq
fordèrt - 14 freq
fordèrin - 26 freq
fordèrs - 3 freq
fordèrsum - 3 freq
fir-tree - 3 freq
fair-trickit - 4 freq
faarder - 1 freq
four-track - 1 freq
fairweather - 1 freq
faerther - 2 freq
forderin - 191 freq
fordered - 22 freq
forderin' - 1 freq
forderins - 3 freq
forederin - 1 freq
forderer - 2 freq
fowre-traks - 1 freq
fréderic - 1 freq
frédéric - 1 freq
faurther - 3 freq
fraternities - 1 freq
furthwart - 1 freq
furthermore - 1 freq
feery-tarry - 1 freq
furthermair - 10 freq
foirduir - 1 freq
fortrace - 7 freq
€œfrederik - 1 freq
furders - 1 freq
fortriu - 1 freq
fortrose - 2 freq
fraternisin - 1 freq
firdered - 1 freq
ferther - 4 freq
fore-door - 7 freq
furdermair - 1 freq
fordert - 4 freq
fruit-draps - 1 freq
fair-tricket - 2 freq
forthright - 2 freq
fwriterss - 10 freq
fraternise - 1 freq
forthroadbridge - 1 freq
friedrich - 1 freq
MetaPhone code - FRTR
forder - 95 freq
furder - 53 freq
vreeter - 1 freq
verdur - 1 freq
farder - 31 freq
farter - 1 freq
fritter - 21 freq
furdèr - 1 freq
ferdir - 1 freq
ferder - 10 freq
fordèr - 46 freq
fir-tree - 3 freq
faarder - 1 freq
verdroß - 1 freq
feery-tarry - 1 freq
foirduir - 1 freq
fortriu - 1 freq
fore-door - 7 freq
verdure - 1 freq
FORE-DOOR
Time to execute Levenshtein function - 0.221918 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.347039 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.029386 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.037007 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.000797 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.