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 differinÂ’ in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
differinÂ’ (0) - 1 freq
differin' (2) - 1 freq
differince (2) - 3 freq
differiny (2) - 1 freq
differin (2) - 6 freq
differing (2) - 2 freq
differint (2) - 24 freq
sifferin (3) - 3 freq
differen (3) - 1 freq
differance (3) - 2 freq
difference (3) - 143 freq
differn (3) - 1 freq
diffrint (3) - 3 freq
deifferin (3) - 1 freq
different (3) - 741 freq
differunt (3) - 1 freq
differinces (3) - 1 freq
oafferin (4) - 1 freq
sufferin (4) - 36 freq
diffren (4) - 1 freq
indifferince (4) - 1 freq
differ's (4) - 1 freq
differed (4) - 1 freq
differently (4) - 16 freq
durinÂ’ (4) - 1 freq
differinÂ’ (0) - 1 freq
differint (4) - 24 freq
differin (4) - 6 freq
differing (4) - 2 freq
differiny (4) - 1 freq
differince (4) - 3 freq
differin' (4) - 1 freq
deifferin (5) - 1 freq
different (5) - 741 freq
differunt (5) - 1 freq
differinces (5) - 1 freq
diffrint (5) - 3 freq
differn (5) - 1 freq
differen (5) - 1 freq
differance (5) - 2 freq
difference (5) - 143 freq
deiffrint (6) - 1 freq
deifferent (6) - 11 freq
deifferand (6) - 8 freq
diffrent (6) - 17 freq
durinÂ’ (6) - 1 freq
diffrence (6) - 10 freq
differences (6) - 34 freq
firinÂ’ (6) - 1 freq
differently (6) - 16 freq
SoundEx code - D165
difference - 143 freq
different - 741 freq
differences - 34 freq
differently - 16 freq
doverin - 15 freq
devoorin - 2 freq
deformities - 1 freq
differen - 1 freq
deveron - 1 freq
diff'rence - 2 freq
diffrence - 10 freq
diff'rent - 3 freq
devourin - 6 freq
deveronside - 1 freq
differint - 24 freq
differinces - 1 freq
differince - 3 freq
diffrent - 17 freq
differin - 6 freq
diffrint - 3 freq
deefferent - 2 freq
dïffrence - 2 freq
dïffrent - 1 freq
dif'rent - 1 freq
differiny - 1 freq
differentiated - 1 freq
deifferand - 8 freq
deifferin - 1 freq
doavrin - 1 freq
differin' - 1 freq
deiffrint - 1 freq
deiferences - 1 freq
deiferent - 5 freq
deiference - 1 freq
diffrmnt - 1 freq
deeferent - 4 freq
deifferent - 11 freq
differentiation - 4 freq
dyperin - 1 freq
deference - 4 freq
differing - 2 freq
deeference - 1 freq
€˜different - 1 freq
doberman - 2 freq
dífferent - 1 freq
deifferences - 1 freq
differential - 1 freq
differance - 2 freq
differunt - 1 freq
€¦different - 1 freq
deformed - 1 freq
differn - 1 freq
diffren - 1 freq
diffrences - 1 freq
differentiate - 1 freq
deform - 1 freq
deborahmeaden - 2 freq
differinÂ’ - 1 freq
dfrntdrmmr - 1 freq
defreend - 1 freq
MetaPhone code - TFRN
doverin - 15 freq
devoorin - 2 freq
tavern - 16 freq
differen - 1 freq
deveron - 1 freq
taivern - 14 freq
devourin - 6 freq
differin - 6 freq
differiny - 1 freq
deifferin - 1 freq
doavrin - 1 freq
differin' - 1 freq
differn - 1 freq
diffren - 1 freq
differinÂ’ - 1 freq
DIFFERINÂ’
Time to execute Levenshtein function - 0.226222 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.392536 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.029106 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.038957 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.000972 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.