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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
fran (0) - 1 freq
ran (1) - 451 freq
fraa (1) - 2 freq
wran (1) - 2 freq
frac (1) - 3 freq
f'an (1) - 1 freq
frae (1) - 4566 freq
pran (1) - 1 freq
fray (1) - 10 freq
iran (1) - 2 freq
cran (1) - 15 freq
franc (1) - 6 freq
fuan (1) - 2 freq
frank (1) - 66 freq
frag (1) - 1 freq
bran (1) - 11 freq
frau (1) - 1 freq
gran (1) - 232 freq
flan (1) - 3 freq
fram (1) - 1 freq
'ran (1) - 1 freq
aran (1) - 5 freq
faan (1) - 70 freq
fan (1) - 1367 freq
fra (1) - 11 freq
fran (0) - 1 freq
foran (1) - 1 freq
foan (2) - 1 freq
firin (2) - 29 freq
franz (2) - 1 freq
fan (2) - 1367 freq
aran (2) - 5 freq
faan (2) - 70 freq
farin (2) - 10 freq
fra (2) - 11 freq
froun (2) - 5 freq
froon (2) - 8 freq
frein (2) - 36 freq
frien (2) - 61 freq
froin (2) - 1 freq
fern (2) - 5 freq
freen (2) - 220 freq
furin (2) - 1 freq
'ran (2) - 1 freq
fryin (2) - 15 freq
wran (2) - 2 freq
iran (2) - 2 freq
ran (2) - 451 freq
fray (2) - 10 freq
frae (2) - 4566 freq
SoundEx code - F650
form - 290 freq
from - 594 freq
ferm - 340 freq
firm - 67 freq
freen - 220 freq
freein - 3 freq
frame - 63 freq
frien - 61 freq
fairm - 126 freq
forran - 1 freq
frein - 36 freq
froun - 5 freq
furrin - 7 freq
firin - 29 freq
froon - 8 freq
farin - 10 freq
fryin - 15 freq
fairin - 13 freq
form' - 2 freq
'freen' - 2 freq
fern - 5 freq
farm - 28 freq
froin - 1 freq
ferryin - 2 freq
fyrein - 1 freq
fearin - 4 freq
forum - 37 freq
'frien - 1 freq
froma - 1 freq
fran - 1 freq
furm - 20 freq
'freen - 1 freq
frien' - 1 freq
faerin - 1 freq
fairm' - 1 freq
frown - 5 freq
feerin - 1 freq
freen' - 2 freq
forrin - 6 freq
forenön - 1 freq
'from' - 1 freq
'frim - 1 freq
foarm - 66 freq
fore-en - 2 freq
forehan - 4 freq
far-han - 2 freq
fremm - 5 freq
fur'm - 1 freq
fermi - 5 freq
furrowin - 1 freq
fram - 1 freq
freehaun - 1 freq
forhooiein - 2 freq
fairnie - 30 freq
fourmi - 1 freq
fire-new - 1 freq
furran - 1 freq
feirm - 4 freq
frem - 2 freq
furein - 1 freq
furin - 1 freq
fore-a-haun - 1 freq
franny - 3 freq
furrum - 1 freq
frim - 1 freq
€˜from - 1 freq
fuar'n - 2 freq
fernie - 1 freq
firinÂ’ - 1 freq
foran - 1 freq
ferim - 1 freq
for nou - 1 freq
MetaPhone code - FRN
freen - 220 freq
freein - 3 freq
frien - 61 freq
forran - 1 freq
frein - 36 freq
froun - 5 freq
furrin - 7 freq
firin - 29 freq
froon - 8 freq
farin - 10 freq
fairin - 13 freq
'freen' - 2 freq
fern - 5 freq
foreign - 69 freq
froin - 1 freq
fyrein - 1 freq
fearin - 4 freq
'frien - 1 freq
fran - 1 freq
'freen - 1 freq
frien' - 1 freq
faerin - 1 freq
frown - 5 freq
feerin - 1 freq
freen' - 2 freq
forrin - 6 freq
fore-en - 2 freq
'foreign' - 1 freq
fairnie - 30 freq
furreign - 6 freq
fire-new - 1 freq
furran - 1 freq
furein - 1 freq
furin - 1 freq
franny - 3 freq
€žforeign - 1 freq
veerin - 1 freq
fuar'n - 2 freq
fernie - 1 freq
firinÂ’ - 1 freq
foran - 1 freq
voorn - 1 freq
for nou - 1 freq
FRAN
Time to execute Levenshtein function - 0.208703 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.347590 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.027484 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.037239 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.003975 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.