Message-ID: <e6663d200603230655k3cdd225bs1d12293c45ae4561@mail.gmail.com>
Date: Thu, 23 Mar 2006 09:55:43 -0500
In-Reply-To: <20060323063315.F56781@mail.sksys.net>
MIME-Version: 1.0
Content-Type: multipart/alternative; boundary="----=_Part_2053_10821619.1143125743635"
References: <1073788385.20060322143818@mail.ru>	 <20060322153201.L33225@mail.sksys.net>	 <e6663d200603220716h568c06d4pfdf753a216c612a6@mail.gmail.com>	 <20060323063315.F56781@mail.sksys.net>
Errors-to: lojban-list-bounce@lojban.org
To: lojban@yahoogroups.com
From: "Matt Arnold" <lojban-out@lojban.org>
Reply-To: matt.mattarn@gmail.com
Subject: [lojban] Re: Suggestions for jboselkei
Content-Length: 3387
Lines: 70

           
------=_Part_2053_10821619.1143125743635 
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Content-Disposition: inline

On 3/22/06, Cyril Slobin <slobin@sksys.net> wrote:
>
> On Wed, 22 Mar 2006, Matt Arnold wrote:
>
> The problem is not a computer speed, but a human speed. We need to
> recive three reviews from three different reviewers to calculate average
> value, and this can take long time.


In an ideal world, we would be able to compute the rating as a probability
curve as they do on OK Cupid. http://www.okcupid.com/static?p=3Dfaq#2.6

The more reviews that a translation has, the more certain the score would
be. In other words, a translation with only one review would not be very
certain, so the curve would be spread out across a high and low range of th=
e
rating scale. As more reviews are made, if the review numbers agree, the
curve gets narrower and narrower toward a point on the scale. If they
disagree, they can spread out the curve. In this way, a result can be
computed immediately without having to wait for three reviewers.

The fact is, we are dealing with a some subjective judgements and not all
reviewers are of equal skill. jboselkei is certain to have a margin of
error, so a probability curve is more appropriate than a number.

However, I understand that it would be very difficult software to program.
The system we already have is great and I'm not complaining.

-epkat
           
------=_Part_2053_10821619.1143125743635 
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Content-Disposition: inline

On 3/22/06, <b class=3D"gmail_sendername">Cyril Slobin</b> &lt;<a href=3D"m=
ailto:slobin@sksys.net">slobin@sksys.net</a>&gt; wrote:<div><span class=3D"=
gmail_quote"></span><blockquote class=3D"gmail_quote" style=3D"border-left:=
 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex=
;">
On Wed, 22 Mar 2006, Matt Arnold wrote:<br><br>The problem is not a compute=
r speed, but a human speed. We need to<br>recive three reviews from three d=
ifferent reviewers to calculate average<br>value, and this can take long ti=
me.
</blockquote><div><br>In an ideal world, we would be able to compute the ra=
ting as a probability curve as they do on OK Cupid. <a href=3D"http://www.o=
kcupid.com/static?p=3Dfaq#2.6">http://www.okcupid.com/static?p=3Dfaq#2.6</a=
><br>
<br>The more reviews that a translation has, the more certain the score wou=
ld be. In other words, a translation with only one review would not be very=
 certain, so the curve would be spread out across a high and low range of t=
he rating scale. As more reviews are made, if the review numbers agree, the=
 curve gets narrower and narrower toward a point on the scale. If they disa=
gree, they can spread out the curve. In this way, a result can be computed =
immediately without having to wait for three reviewers.
<br><br>The fact is, we are dealing with a some subjective judgements and n=
ot
all reviewers are of equal skill. jboselkei is certain to have a margin
of error, so a probability curve is more appropriate than a number.<br><br>=
However, I understand that it would be very difficult software to program. =
The system we already have is great and I'm not complaining.<br><br>-epkat
<br></div></div>
           
------=_Part_2053_10821619.1143125743635--