[prev in list] [next in list] [prev in thread] [next in thread] 

List:       aspell-user
Subject:    [Aspell-user] Can I get "edit distance" for the suggestions?
From:       "Ethan Bradford" <ethanb () google ! com>
Date:       2006-03-31 23:31:51
Message-ID: 6b327d700603311531l315c8e43y27d54517289bc480 () mail ! google ! com
[Download RAW message or body]

I'm mystified as to how the definition of *AspellStringEnumeration* is
hidden from us, so I can't peek inside of that.  It seems obvious from the
outside that edit distance (i.e. the # of changes necessary to get from the
checked word to a proposed suggestion) is used to sort the results presente=
d
to the user.  I'd like to use outside information to sort the results with
equal edit distance w.r.t. eachother.  So how do I get the edit distance?

-- Ethan

p.s. the Arabic project is going well.  We can generate an Aspell db that
has the full coverage of Buckwalter's data.  It over-generates a little bit=
,
though, but we're well on the way to solving that, too.  It's time to start
thinking about how to get the results available for general distribution.
It will be a little bit tricky because we want to keep the Buckwalter data
as primary, so that if you want to add a word or change an affix rule, you
would edit those files and run our scripts again.

[Attachment #3 (text/html)]

I'm mystified as to how the definition of <font size="-1"><b>AspellStringEnum<img \
style="width: 0px;">eration</b><img style="width: 0px;"> is hidden from us, so I \
can't peek inside of that.&nbsp; It seems obvious from the outside that edit distance \
( i.e. the # of changes necessary to get from the checked word to a proposed \
suggestion) is used to sort the results presented to the user.&nbsp; I'd like to use \
                outside information to sort the results with equal edit distance \
                w.r.t
. eachother.&nbsp; So how do I get the edit distance?<br><br>-- Ethan<br><br>p.s. the \
Arabic project is going well.&nbsp; We can generate an Aspell db that has the full \
coverage of Buckwalter's data.&nbsp; It over-generates a little bit, though, but \
we're well on the way to solving that, too.&nbsp; It's time to start thinking about \
how to get the results available for general distribution.&nbsp; It will be a little \
bit tricky because we want to keep the Buckwalter data as primary, so that if you \
want to add a word or change an affix rule, you would edit those files and run our \
scripts again. <br></font><font size="-1"> </font>



[prev in list] [next in list] [prev in thread] [next in thread]