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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
bbchighlands (0) - 1 freq
highlands (3) - 12 freq
bbcnireland (4) - 2 freq
highlans (4) - 1 freq
highland (4) - 31 freq
boglands (5) - 1 freq
bbcscotland (5) - 30 freq
backlands (5) - 1 freq
€˜hielands (5) - 1 freq
highlander (5) - 7 freq
lochlands (5) - 1 freq
hielands (5) - 11 freq
brigands (5) - 1 freq
rsrhighlander (5) - 9 freq
highlanders (5) - 17 freq
hicland (6) - 1 freq
behinds (6) - 1 freq
hielans (6) - 17 freq
rochians (6) - 1 freq
scotlands (6) - 2 freq
birthland's (6) - 1 freq
heelands (6) - 1 freq
highlander' (6) - 1 freq
hieland (6) - 16 freq
pechtland (6) - 2 freq
bbchighlands (0) - 1 freq
highlands (6) - 12 freq
highland (8) - 31 freq
highlans (8) - 1 freq
bbcnireland (8) - 2 freq
highlander (9) - 7 freq
rsrhighlander (9) - 9 freq
lochlands (9) - 1 freq
bbcscotland (9) - 30 freq
backlands (9) - 1 freq
highlanders (9) - 17 freq
boglands (9) - 1 freq
maclaughlan's (10) - 1 freq
backgrunds (10) - 3 freq
bbcsounds (10) - 1 freq
lochgarland (10) - 1 freq
backgroonds (10) - 1 freq
devihighlander (10) - 1 freq
€˜hielands (10) - 1 freq
brigands (10) - 1 freq
hielands (10) - 11 freq
hairtlands (11) - 1 freq
shawlands (11) - 1 freq
heilands (11) - 1 freq
chileans (11) - 1 freq
SoundEx code - B224
basically - 35 freq
bicycle - 8 freq
bi-sexual - 1 freq
bicycles - 1 freq
bisexuality - 1 freq
bbchighlands - 1 freq
beckyexcell - 1 freq
buckiehighlib - 1 freq
MetaPhone code - BXFLNTS
bbchighlands - 1 freq
BBCHIGHLANDS
Time to execute Levenshtein function - 0.351918 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.705327 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.063953 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.037224 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.