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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
flouers (0) - 67 freq
floeers (1) - 3 freq
flouer' (1) - 1 freq
glouers (1) - 1 freq
flouery (1) - 1 freq
flocers (1) - 1 freq
flouer (1) - 26 freq
'flouers (1) - 1 freq
flowers (1) - 15 freq
flooers (1) - 197 freq
losers (2) - 3 freq
lousers (2) - 1 freq
lowers (2) - 7 freq
touers (2) - 4 freq
lours (2) - 4 freq
floo'rs (2) - 1 freq
slopers (2) - 1 freq
plouters (2) - 1 freq
loners (2) - 1 freq
flooery (2) - 13 freq
flooer (2) - 151 freq
footers (2) - 3 freq
flouerie (2) - 2 freq
fluirs (2) - 4 freq
floÂ’ers (2) - 2 freq
flouers (0) - 67 freq
flooers (1) - 197 freq
floeers (1) - 3 freq
fluirs (2) - 4 freq
floors (2) - 22 freq
floours (2) - 1 freq
fleers (2) - 1 freq
flores (2) - 1 freq
fleurs (2) - 2 freq
flowers (2) - 15 freq
'flouers (2) - 1 freq
flocers (2) - 1 freq
flouer (2) - 26 freq
flouery (2) - 1 freq
flouer' (2) - 1 freq
glouers (2) - 1 freq
floer (3) - 2 freq
fowers (3) - 7 freq
fiooers (3) - 2 freq
flairs (3) - 16 freq
floo'ers (3) - 2 freq
flouerin (3) - 2 freq
floes (3) - 1 freq
flyters (3) - 1 freq
flares (3) - 10 freq
SoundEx code - F462
floors - 22 freq
failures - 6 freq
flee'ers - 1 freq
flooers - 197 freq
floorishin - 2 freq
flouers - 67 freq
flourish - 23 freq
flair's - 3 freq
'flooers - 1 freq
'flers-courcelette' - 1 freq
flares - 10 freq
flairs - 16 freq
flourishin - 5 freq
follaers - 108 freq
followers - 35 freq
fluorescent - 4 freq
fleres - 1 freq
floories - 8 freq
florish - 1 freq
flowers - 15 freq
flee'rs - 1 freq
flooers'r - 1 freq
floo'ers - 2 freq
flora's - 1 freq
fluirs - 4 freq
flourishit - 1 freq
fleers - 1 freq
flures - 2 freq
flourescent - 5 freq
fillers - 1 freq
flooery-smellin - 1 freq
fluorescents - 1 freq
flourished - 4 freq
flee-ers - 2 freq
floours - 1 freq
feelurs - 1 freq
flurespace - 1 freq
folloers - 1 freq
fowler's - 1 freq
followers' - 1 freq
'flouers - 1 freq
flouers'll - 1 freq
flourishes - 3 freq
fleerish - 5 freq
flurries - 2 freq
flooeries - 1 freq
flores - 1 freq
florestii - 1 freq
floorish - 3 freq
floorishes - 1 freq
flourishet - 1 freq
florists - 1 freq
feelers - 1 freq
florescent - 1 freq
fleerspace - 1 freq
flow'rs - 3 freq
flower's - 1 freq
full-rigged - 1 freq
fleurs - 2 freq
faelyirs - 1 freq
floeers - 3 freq
‘followers’ - 1 freq
floowers - 1 freq
floÂ’ers - 2 freq
floo'rs - 1 freq
flooerÂ’s - 1 freq
follyers - 1 freq
MetaPhone code - FLRS
floors - 22 freq
failures - 6 freq
flee'ers - 1 freq
flooers - 197 freq
flouers - 67 freq
flair's - 3 freq
'flooers - 1 freq
flares - 10 freq
valorous - 2 freq
flairs - 16 freq
follaers - 108 freq
fleres - 1 freq
floories - 8 freq
flee'rs - 1 freq
floo'ers - 2 freq
flora's - 1 freq
ghilarza - 1 freq
fluirs - 4 freq
fleers - 1 freq
flures - 2 freq
fillers - 1 freq
flee-ers - 2 freq
floours - 1 freq
feelurs - 1 freq
folloers - 1 freq
fowler's - 1 freq
velars - 1 freq
'flouers - 1 freq
flurries - 2 freq
flooeries - 1 freq
flores - 1 freq
€˜violaris - 1 freq
feelers - 1 freq
flow'rs - 3 freq
fleurs - 2 freq
floeers - 3 freq
floÂ’ers - 2 freq
floo'rs - 1 freq
flooerÂ’s - 1 freq
FLOUERS
Time to execute Levenshtein function - 0.254871 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.416454 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.027885 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.037193 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.000925 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.