| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
| |
|
| |
|
|
|
|
| |
after 5.4-RELEASE.
|
|
|
|
| |
Ports Collection documentation and use 'ARCH' rather than 'MACHINE_ARCH'.
|
| |
|
|
|
|
| |
Approved by: vanilla (co-mentor)
|
|
|
|
|
|
|
|
|
|
|
|
| |
- Many bugs were discovered and fixed. A test suite was added to
prevent future regressions. It can be called using make check.
Memory management was improved, giving a large speedup in
classification speed, and a putative confidence score is now
available via an -X switch.
- Some documentation changes were made.
PR: ports/69749
Submitted by: maintainer
|
|
|
|
|
| |
PR: ports/69407
Submitted by: maintainer
|
|
|
|
|
| |
PR: 69386
Submitted by: maintainer
|
| |
|
|
|
|
|
| |
PR: ports/60753
Submitted by: Cheng-Lung Sung <clsung@dragon2.net> (maintainer)
|
|
dbacl is a digramic Bayesian text classifier. Given some text,
it calculates the posterior probabilities that the input resembles
one of any number of previously learned document collections.
It can be used to sort incoming email into arbitrary categories
such as spam, work, and play, or simply to distinguish an English text
from a French text. It fully supports international character sets,
and uses sophisticated statistical models based on the
Maximum Entropy Principle.
Author: Laird A. Breyer <laird@lbreyer.com>
WWW: http://dbacl.sourceforge.net/
PR: 58733
Submitted by: Cheng-Lung Sung <clsung@dragon2.net>
|