From: atma <atma@...>
Date: 2012-12-18T18:28:27+09:00
Subject: Re: Generate unique texts on given constraints

------=_Part_12156_620862365.1355822904808
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

Hello,

here: http://stackoverflow.com/questions/246961/algorithm-to-find-articles-=
with-similar-text

---- On Mon, 17 Dec 2012 06:10:03 -0800 Eugeni Kurtov&lt;lists@ruby-forum.c=
om&gt; wrote ----=20


Warning: this topic is on broken english! ;(=20
=20
Hello! The idea is that user enter or mark=20
a) valid synonyms for words in the text (each word separately)=20
b) valid replacement for groups of words - expressions (each expression=20
separately), e.g. "danke sch=C3=B6n" for "thank you"=20
Task: to built a texts which uniqueness will be not less than a given=20
threshold (say 75%).=20
The main question is what is the way to compare the uniqueness of the=20
text to each other?=20
And also whether to make a sequential enumeration of all the possible=20
variation of the word for whole text or to pull them in random order?=20
=20
--=20
Posted via http://www.ruby-forum.com/.=20




------=_Part_12156_620862365.1355822904808
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head>=
<meta content=3D"text/html;charset=3DUTF-8" http-equiv=3D"Content-Type"></h=
ead><body ><div style=3D'font-size:10pt;font-family:Verdana,Arial,Helvetica=
,sans-serif;'>Hello,<div><br></div><div>here:&nbsp;http://stackoverflow.com=
/questions/246961/algorithm-to-find-articles-with-similar-text<br><div id=
=3D"1"><br>---- On Mon, 17 Dec 2012 06:10:03 -0800 <b>Eugeni Kurtov&lt;list=
s@ruby-forum.com&gt;</b> wrote ---- <br></div><br><blockquote style=3D"bord=
er-left: 1px solid #0000FF; padding-left: 6px;">Warning: this topic is on b=
roken english! ;( <br> <br>Hello! The idea is that user enter or mark <br>a=
) valid synonyms for words in the text (each word separately) <br>b) valid =
replacement for groups of words - expressions (each expression <br>separate=
ly), e.g. "danke sch=C3=B6n" for "thank you" <br>Task: to built a  texts wh=
ich uniqueness will be not less than a given <br>threshold (say 75%). <br>T=
he main question is what is the way to compare the uniqueness of the <br>te=
xt to each other? <br>And also whether to make a sequential enumeration of =
all the possible <br>variation of the word for whole text or to pull them i=
n random order? <br> <br>--  <br>Posted via <a href=3D"http://www.ruby-foru=
m.com/" target=3D"_blank">http://www.ruby-forum.com/</a>. <br></blockquote>=
<br></div></div></body></html>
------=_Part_12156_620862365.1355822904808--