'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.
DocumentationUser manpage available in HTML format from http://dbacl.sourceforge.net/man.html; User tutorial available in HTML format from http://dbacl.sourceforge.net/tutorial.html
released on 6 July 2005
|License||Verified by||Verified on||Notes|
|GPLv2orlater||Janet Casey||28 August 2003|
Leaders and contributors
Resources and communication
|Developer||VCS Repository Webview||http://sourceforge.net/cvs/?group_id=70464|
This entry (in part or in whole) was last reviewed on 7 June 2005.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.