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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
buirial (0) - 4 freq
burial (1) - 12 freq
birian (2) - 1 freq
buirit (2) - 12 freq
buiriet (2) - 1 freq
burrian (2) - 1 freq
beirials (2) - 1 freq
beerial (2) - 10 freq
burials (2) - 1 freq
buiried (2) - 2 freq
bunnil (3) - 8 freq
buirn (3) - 2 freq
bestial (3) - 1 freq
beirin (3) - 4 freq
birsay (3) - 12 freq
bureau (3) - 11 freq
birl (3) - 92 freq
buildan (3) - 2 freq
buikish (3) - 1 freq
buriet (3) - 14 freq
nuptial (3) - 8 freq
burra (3) - 62 freq
trivial (3) - 3 freq
burrito (3) - 1 freq
buikies (3) - 3 freq
buirial (0) - 4 freq
burial (1) - 12 freq
beerial (2) - 10 freq
buiried (3) - 2 freq
burl (3) - 6 freq
birl (3) - 92 freq
burel (3) - 1 freq
burials (3) - 1 freq
birian (3) - 1 freq
buirit (3) - 12 freq
beirials (3) - 1 freq
buiriet (3) - 1 freq
biried (4) - 3 freq
aural (4) - 1 freq
birlan (4) - 18 freq
bial (4) - 1 freq
beerials (4) - 4 freq
bridal (4) - 4 freq
muriel (4) - 5 freq
unreal (4) - 10 freq
birly (4) - 10 freq
burka (4) - 1 freq
braaly (4) - 42 freq
burma (4) - 5 freq
burie (4) - 4 freq
SoundEx code - B640
barrel - 40 freq
birl - 92 freq
baurel - 2 freq
bruil - 1 freq
brawly - 36 freq
brawlie - 28 freq
barely - 96 freq
burl - 6 freq
barley - 31 freq
bar-l - 1 freq
baurley - 2 freq
buirial - 4 freq
brolly - 15 freq
brill - 12 freq
burial - 12 freq
burly - 5 freq
beerial - 10 freq
burrel - 1 freq
braaly - 42 freq
bruilyie - 1 freq
brulyie - 1 freq
beryl - 2 freq
borrelia - 1 freq
braali - 27 freq
'braali - 1 freq
'birl - 1 freq
braalie - 3 freq
brel - 2 freq
beriall - 1 freq
burrell - 4 freq
berryhill - 6 freq
burel - 1 freq
braille - 6 freq
brawl - 1 freq
brally - 4 freq
barolo - 1 freq
birly - 10 freq
€œbirly - 1 freq
€œbraaly - 2 freq
bheurla - 2 freq
bburlu - 1 freq
barl - 1 freq
braally - 1 freq
burley - 1 freq
barlow - 1 freq
beurla - 1 freq
MetaPhone code - BRL
barrel - 40 freq
birl - 92 freq
baurel - 2 freq
bruil - 1 freq
brawly - 36 freq
brawlie - 28 freq
barely - 96 freq
burl - 6 freq
barley - 31 freq
bar-l - 1 freq
baurley - 2 freq
buirial - 4 freq
brolly - 15 freq
brill - 12 freq
burial - 12 freq
burly - 5 freq
beerial - 10 freq
burrel - 1 freq
braaly - 42 freq
beryl - 2 freq
borrelia - 1 freq
braali - 27 freq
'braali - 1 freq
'birl - 1 freq
braalie - 3 freq
brel - 2 freq
beriall - 1 freq
burrell - 4 freq
burel - 1 freq
braille - 6 freq
brawl - 1 freq
brally - 4 freq
barolo - 1 freq
birly - 10 freq
€œbirly - 1 freq
€œbraaly - 2 freq
bburlu - 1 freq
barl - 1 freq
braally - 1 freq
burley - 1 freq
barlow - 1 freq
beurla - 1 freq
BUIRIAL
Time to execute Levenshtein function - 0.197519 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.350321 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.029455 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.036877 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.000794 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.