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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
oniebuddie (0) - 22 freq
naebuddie (2) - 26 freq
oniebodie (2) - 80 freq
onieboadie (2) - 10 freq
naebuddies (3) - 3 freq
'oniebodie (3) - 2 freq
naeboddie (3) - 2 freq
onybuddies (3) - 1 freq
€œnaebuddie (3) - 1 freq
somebuddie (3) - 1 freq
naebuddiie (3) - 1 freq
onicbodie (3) - 1 freq
anybuddie (3) - 3 freq
awbuddie (4) - 15 freq
ahbuddie (4) - 3 freq
sumbuddie (4) - 2 freq
naebiddies (4) - 1 freq
oneibodie (4) - 1 freq
onybuddy (4) - 8 freq
omebodie (4) - 1 freq
naebuddie's (4) - 1 freq
naeboadie (4) - 11 freq
neddie (4) - 1 freq
onneybudce (4) - 1 freq
naeb'die (4) - 1 freq
oniebuddie (0) - 22 freq
naebuddie (2) - 26 freq
naeboddie (3) - 2 freq
anybuddie (3) - 3 freq
naebuddiie (3) - 1 freq
oniebodie (3) - 80 freq
onieboadie (3) - 10 freq
naebuddies (4) - 3 freq
onybuddies (4) - 1 freq
onybuddy (4) - 8 freq
naebuddy (4) - 3 freq
buddie (5) - 28 freq
naebodie (5) - 75 freq
onybodie (5) - 5 freq
oneybudee (5) - 3 freq
onybiddy (5) - 8 freq
nobuddy (5) - 1 freq
anybuddy (5) - 1 freq
naeb'die (5) - 1 freq
inybuddy (5) - 1 freq
naebiddy (5) - 32 freq
oniebody (5) - 15 freq
oanybuddy (5) - 1 freq
naebiddies (5) - 1 freq
onicbodie (5) - 1 freq
SoundEx code - O513
onybody - 416 freq
oniebody - 15 freq
onybdy's - 1 freq
onybdy - 9 freq
oanybody - 1 freq
'onybody - 1 freq
oniebodie - 80 freq
onybodie - 5 freq
onbody - 1 freq
onbody's - 1 freq
onybudy - 6 freq
oneybudee - 3 freq
oneybudy - 1 freq
onneybudce - 1 freq
oanyboady - 1 freq
onybody's - 3 freq
oniebuddie - 22 freq
onvbody - 1 freq
onieboadie - 10 freq
omebodie - 1 freq
oneibodie - 1 freq
'oniebodie - 2 freq
onybody'll - 1 freq
oonbidden - 1 freq
onybiddy - 8 freq
omb'dy - 1 freq
onpit - 1 freq
onyboady - 1 freq
onib'dy - 1 freq
€œonybody - 2 freq
onybuddy - 8 freq
oanybuddy - 1 freq
onybidy - 1 freq
onefatninjacat - 3 freq
onybÂ’dy - 2 freq
onybud - 1 freq
onybuddies - 1 freq
onybodys - 1 freq
MetaPhone code - ONBT
onybody - 416 freq
oniebody - 15 freq
onybdy - 9 freq
oanybody - 1 freq
'onybody - 1 freq
oniebodie - 80 freq
onybodie - 5 freq
onbody - 1 freq
onybudy - 6 freq
oneybudee - 3 freq
oneybudy - 1 freq
oanyboady - 1 freq
oniebuddie - 22 freq
onieboadie - 10 freq
oneibodie - 1 freq
'oniebodie - 2 freq
onybiddy - 8 freq
onyboady - 1 freq
onib'dy - 1 freq
€œonybody - 2 freq
onybuddy - 8 freq
oanybuddy - 1 freq
onybidy - 1 freq
onybÂ’dy - 2 freq
onybud - 1 freq
ONIEBUDDIE
Time to execute Levenshtein function - 0.191085 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.393308 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.027538 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.036928 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.000839 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.