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 rose-bush in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
rose-bush (0) - 1 freq
rosebush (1) - 1 freq
rosehauch (3) - 1 freq
rose-bed (3) - 1 freq
rosebuds (3) - 1 freq
whin-bush (4) - 1 freq
roush (4) - 1 freq
rose-rid (4) - 1 freq
byre-brush (4) - 1 freq
rose-fite (4) - 1 freq
gowd-fush (4) - 2 freq
rome-nut (4) - 1 freq
rose's (4) - 2 freq
rosehips (4) - 1 freq
rosebeds (4) - 1 freq
rose-hip (4) - 1 freq
rosebusses (4) - 1 freq
love-bug (4) - 1 freq
tae-bash (4) - 1 freq
robust (4) - 10 freq
rosemount (4) - 4 freq
nose-bag (4) - 1 freq
roses (4) - 102 freq
rose-tree (4) - 18 freq
rose-gundy (4) - 1 freq
rose-bush (0) - 1 freq
rosebush (2) - 1 freq
rose-bed (5) - 1 freq
tae-bash (6) - 1 freq
rosebuds (6) - 1 freq
rosehauch (6) - 1 freq
roses (7) - 102 freq
nose-bag (7) - 1 freq
robust (7) - 10 freq
rose-tree (7) - 18 freq
ragabash (7) - 5 freq
rubbish (7) - 69 freq
rosebusses (7) - 1 freq
rosebed (7) - 1 freq
rose-gundy (7) - 1 freq
hush-hush (7) - 1 freq
rose-rid (7) - 1 freq
rose-fite (7) - 1 freq
byre-brush (7) - 1 freq
roush (7) - 1 freq
whin-bush (7) - 1 freq
rose's (7) - 2 freq
rosebeds (7) - 1 freq
rose-hip (7) - 1 freq
rosehips (7) - 1 freq
SoundEx code - R212
respected - 11 freq
respect - 164 freq
respectful - 5 freq
ragabash - 5 freq
rosebusses - 1 freq
respeckit - 15 freq
respeck - 77 freq
respectfully - 1 freq
respectively - 2 freq
rasps - 11 freq
respective - 5 freq
respectable - 12 freq
respeckfu - 4 freq
respec - 5 freq
respectably - 1 freq
respectit - 12 freq
rspca - 4 freq
respectet - 1 freq
rispect - 1 freq
recipes - 17 freq
respects - 8 freq
respecks - 11 freq
respectin - 4 freq
respectability - 3 freq
respeckin - 2 freq
respectabilty - 1 freq
respectible - 1 freq
respectfu - 5 freq
rag-bug - 1 freq
rock-fast - 2 freq
receives - 3 freq
reykjavík - 6 freq
reykjavík's - 4 freq
'reykjavík - 2 freq
reyjkavik - 1 freq
reykjavik - 1 freq
rock-faced - 1 freq
respekfu - 1 freq
respecktible - 1 freq
rosehips - 1 freq
respecters - 1 freq
respecting - 2 freq
respector - 1 freq
respeckt - 1 freq
respectfu-like - 1 freq
respek - 2 freq
respecktit - 4 freq
respectivelie - 1 freq
rispectible - 1 freq
rosebush - 1 freq
recipies - 1 freq
rose-bush - 1 freq
rjpxyqtb - 1 freq
rkgbsx - 1 freq
rugbysco - 1 freq
ruisjofz - 1 freq
rzpkr - 1 freq
rickbazza - 1 freq
rojpc - 1 freq
rspbscotland - 2 freq
rspbwex - 1 freq
rqbfchj - 1 freq
rizvzz - 1 freq
rxvxnf - 1 freq
rzfqmsu - 1 freq
rsfajxj - 1 freq
MetaPhone code - RSBX
rosebush - 1 freq
rose-bush - 1 freq
ROSE-BUSH
Time to execute Levenshtein function - 0.310435 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.543864 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.035481 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.048224 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.001179 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.