Language, engine, and tooling for expressing, testing, and evaluating composable language rules on input strings.
Go to file
Julien Odent 161889c3e6 README.md + updating cabal
Summary:
* basic `README.md`
* updated `duckling.cabal`

Reviewed By: JonCoens

Differential Revision: D4691967

fbshipit-source-id: 0a5cdf7
2017-03-10 15:04:23 -08:00
Duckling Strip off TODO/FIXME 2017-03-10 12:04:16 -08:00
CONTRIBUTING.md CONTRIBUTING.md 2017-03-10 14:49:18 -08:00
duckling.cabal README.md + updating cabal 2017-03-10 15:04:23 -08:00
ExampleMain.hs Initial commit 2017-03-08 10:33:56 -08:00
LICENSE Initial commit 2017-03-08 10:33:56 -08:00
PATENTS Initial commit 2017-03-08 10:33:56 -08:00
README.md README.md + updating cabal 2017-03-10 15:04:23 -08:00
RegenMain.hs Initial commit 2017-03-08 10:33:56 -08:00
stack.yaml Initial commit 2017-03-08 10:33:56 -08:00
TestMain.hs Initial commit 2017-03-08 10:33:56 -08:00

Duckling

Duckling is a Haskell library that parses text into structured data.

Requirements

A Haskell environment is required. We recommend using stack.

Quickstart

To compile and run the binary:

$ stack build
$ stack exec duckling-example-exec

The first time you run it, it will download all required packages.

To run a source file directly (after compiling once):

$ stack ExampleMain.hs

See ExampleMain.hs for an example on how to integrate Duckling in your project.

To regenerate the classifiers and run the tests:

$ stack RegenMain.hs && stack TestMain.hs

License

Duckling is BSD-licensed. We also provide an additional patent grant.