The hext package

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain]

Warnings:

Please see README.md


[Skip to ReadMe]

Properties

Versions0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4, 0.1.0.4
Change logNone available
Dependenciesbase (>=4.7 && <5), containers, hext, text, unordered-containers [details]
LicenseBSD3
Copyright2016 David Anekstein
AuthorDavid Anekstein
Maintaineraneksteind@gmail.com
CategoryNatural Language Processing
Home pagehttps://github.com/aneksteind/hext#readme
Source repositoryhead: git clone https://github.com/aneksteind/hext
Executableshext-exe
UploadedSat Sep 17 15:02:44 UTC 2016 by aneksteind

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for hext-0.1.0.4

hext

This is currently the beginning of a text classification library.

##Installation/Running stack install hext

hackage - https://hackage.haskell.org/package/hext-0.1.0.3

To run:
stack build
stack exec hext-exe

##Usage

Currently, the only algorithm implementation is the Naive Bayes algorithm: to run your own data through this algorithm in order to classify your text, you need:

In order to run the program, the classified data specified above must be converted into a BayesModel a using the teach function, where a is your own defined data type representing the class to classify your text. Your class must be and instance of Ord and Eq.

With your new BayesModel filled with knowledge, it's time to classify your text using runBayes. An example of this can be seen in app/Main.hs where data Class = Positive | Negative deriving (Eq, Ord, Show) to label movie reviews as either positive or negative.

##Contributing

I encourage contributing to this package, in the form of implementing algorithms that are not yet in the project, improving efficiency, or the like.