Warning: this topic is on broken english! ;( Hello! The idea is that user enter or mark a) valid synonyms for words in the text (each word separately) b) valid replacement for groups of words - expressions (each expression separately), e.g. "danke schön" for "thank you" Task: to built a texts which uniqueness will be not less than a given threshold (say 75%). The main question is what is the way to compare the uniqueness of the text to each other? And also whether to make a sequential enumeration of all the possible variation of the word for whole text or to pull them in random order?
on 2012-12-17 15:09
on 2012-12-18 10:28
Hello, here: http://stackoverflow.com/questions/246961/algorith... ---- On Mon, 17 Dec 2012 06:10:03 -0800 Eugeni Kurtov<lists@ruby-forum.com> wrote ---- Warning: this topic is on broken english! ;( Hello! The idea is that user enter or mark a) valid synonyms for words in the text (each word separately) b) valid replacement for groups of words - expressions (each expression separately), e.g. "danke schön" for "thank you" Task: to built a texts which uniqueness will be not less than a given threshold (say 75%). The main question is what is the way to compare the uniqueness of the text to each other? And also whether to make a sequential enumeration of all the possible variation of the word for whole text or to pull them in random order?
Please log in before posting. Registration is free and takes only a minute.
Existing account
(Switch to SSL-encrypted connection)
NEW: Do you have a Google/GoogleMail or Yahoo account? No registration required!
Log in with Google account | Log in with Yahoo account
Log in with Google account | Log in with Yahoo account
No account? Register here.