Re: Robert...EDS - questions/comments
On 12 Feb 2001, at 13:19, Michael Sabal wrote:
> Could I see your compare routine? Maybe there's a way to sort the data so
> 150K~1M
> compares aren't necessary.
If one assumes every word in the sentence is a typo, then every word must be
compared to find a tree of possible correct words for the entire sentence.
Anything
else is throwing away info.
>(NB: the sort routine could be run when Tiggr recognizes she's
> the only one in the room.
Sorta useless to reply to conversation only after everyone leaves, isn't it?
Kat
>The learning may be a bit slower if there is significant lag
> between updating the DB and sorting it; but then a priority level could be
> assigned to
> that task to let it be done more often.)
>
> Just a thot....
>
> Michael J. Sabal
>
> >>> gertie at PELL.NET 02/12/01 04:06PM >>>
> I have a problem that can only be solved with brute force, since it involves
> comparisons
> with 150,000 words, minimum,,, and if that works out, it could be expanded to
> a million.
>
>
>
|
Not Categorized, Please Help
|
|
