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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
forever (0) - 75 freq
fore'er (1) - 1 freq
fooever (1) - 1 freq
foriver (1) - 30 freq
firever (1) - 4 freq
furever (1) - 8 freq
fariver (2) - 10 freq
foree (2) - 1 freq
fever (2) - 37 freq
filever (2) - 1 freq
finever (2) - 2 freq
foreerm (2) - 1 freq
forivers (2) - 1 freq
forivir (2) - 2 freq
forebear (2) - 3 freq
firrever (2) - 1 freq
hooever (2) - 31 freq
fooiver (2) - 14 freq
freer (2) - 2 freq
forderer (2) - 2 freq
firiver (2) - 2 freq
€˜forever (2) - 1 freq
forivver (2) - 9 freq
furiver (2) - 1 freq
former (2) - 40 freq
forever (0) - 75 freq
firever (1) - 4 freq
foriver (1) - 30 freq
furever (1) - 8 freq
furiver (2) - 1 freq
forivir (2) - 2 freq
fore'er (2) - 1 freq
firiver (2) - 2 freq
fariver (2) - 10 freq
fooever (2) - 1 freq
former (3) - 40 freq
forivver (3) - 9 freq
farivir (3) - 5 freq
firivir (3) - 14 freq
freer (3) - 2 freq
fitever (3) - 14 freq
forder (3) - 97 freq
forevvir (3) - 5 freq
forivers (3) - 1 freq
filever (3) - 1 freq
finever (3) - 2 freq
fooiver (3) - 14 freq
forebear (3) - 3 freq
fever (3) - 37 freq
firrever (3) - 1 freq
SoundEx code - F616
forever - 75 freq
forivver - 9 freq
farivver - 9 freq
foriver - 30 freq
forebears - 23 freq
forbeirance - 1 freq
firever - 4 freq
fair-farrant - 1 freq
forbeir - 3 freq
fervour - 2 freq
forfairn - 2 freq
fripperies - 3 freq
free-birthit - 1 freq
forfar - 10 freq
forebeirs - 7 freq
fariver - 10 freq
firrever - 1 freq
furever - 8 freq
faur-forrit - 1 freq
firivver - 5 freq
firiver - 2 freq
farfir - 2 freq
ferryport - 1 freq
forfarshire - 1 freq
forefront - 5 freq
forevvir - 5 freq
forebeers - 5 freq
fire-brigade - 1 freq
foriverness - 2 freq
firivir - 14 freq
forebear - 3 freq
forivir - 2 freq
farivir - 5 freq
fairport - 1 freq
fuirboards - 1 freq
free-for-aa - 1 freq
€œfarivver - 1 freq
forivers - 1 freq
'fareiver - 1 freq
forebears' - 1 freq
farfarshire - 1 freq
forebearers - 1 freq
forbearers - 1 freq
forbears - 1 freq
freeform - 1 freq
foriver-and-a-day - 1 freq
forbeirs - 1 freq
forebeirers - 1 freq
freeborn - 1 freq
fower-pairt - 1 freq
fireproof - 1 freq
furiver - 1 freq
free-for-aw - 1 freq
forefaren - 1 freq
€˜forever - 1 freq
forbear - 1 freq
fireproofin - 1 freq
fairferfoonert - 1 freq
firriver - 1 freq
fireburn - 1 freq
firebird - 1 freq
forbearance - 1 freq
fairbairn - 7 freq
foreveryes - 1 freq
MetaPhone code - FRFR
forever - 75 freq
forivver - 9 freq
farivver - 9 freq
foriver - 30 freq
firever - 4 freq
fervour - 2 freq
forfar - 10 freq
fariver - 10 freq
firrever - 1 freq
furever - 8 freq
firivver - 5 freq
firiver - 2 freq
farfir - 2 freq
forevvir - 5 freq
firivir - 14 freq
forivir - 2 freq
farivir - 5 freq
free-for-aa - 1 freq
€œfarivver - 1 freq
'fareiver - 1 freq
furiver - 1 freq
free-for-aw - 1 freq
€˜forever - 1 freq
firriver - 1 freq
FOREVER
forever - 75 freq
firever - 4 freq
Time to execute Levenshtein function - 0.186850 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.343470 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.029491 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.037982 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.000963 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.