mirror of
https://github.com/facebook/duckling.git
synced 2024-11-29 01:03:44 +03:00
Language, engine, and tooling for expressing, testing, and evaluating composable language rules on input strings.
2e50aa5ea0
Summary: * we weren't checking the right reference time in `takeNth` and `takeN` * fixing resulting failing tests for `IT` * `analyzedNTest` to check that input results in `n` parsed tokens Reviewed By: niteria Differential Revision: D4698788 fbshipit-source-id: 2cd4762 |
||
|---|---|---|
| Duckling | ||
| CONTRIBUTING.md | ||
| duckling.cabal | ||
| ExampleMain.hs | ||
| LICENSE | ||
| PATENTS | ||
| README.md | ||
| RegenMain.hs | ||
| stack.yaml | ||
| TestMain.hs | ||
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.