This fork was initially created from commit 8d681f7 upstream. Updates are periodically pulled downstream.
Tags/releases follow Semantic Versioning, starting from 0.2.0.
Duckling is a Haskell library that parses text into structured data.
"the first Tuesday of October"
=> {"value":"2017-10-03T00:00:00.000-07:00","grain":"day"}
A Haskell environment is required. We recommend using stack.
On macOS you'll need to install PCRE development headers. The easiest way to do that is with Homebrew:
brew install pcre
If that doesn't help, try running brew doctor and fix
the issues it finds.
To compile and run the binary:
$ stack build
$ stack exec duckling-example-exe
The first time you run it, it will download all required packages.
This runs a basic HTTP server. Example request:
$ curl -XPOST http://0.0.0.0:8000/parse --data 'locale=en_GB&text=tomorrow at eight'
In the example application, all dimensions are enabled by default. Provide the parameter dims to specify which ones you want. Examples:
Identify credit card numbers only:
$ curl -XPOST http://0.0.0.0:8000/parse --data 'locale=en_US&text="4111-1111-1111-1111"&dims="[\"credit-card-number\"]"'
If you want multiple dimensions, comma-separate them in the array:
$ curl -XPOST http://0.0.0.0:8000/parse --data 'locale=en_US&text="3 cups of sugar"&dims="[\"quantity\",\"numeral\"]"'
See exe/ExampleMain.hs for an example on how to integrate Duckling in your
project.
If your backend doesn't run Haskell or if you don't want to spin your own Duckling server, you can directly use wit.ai's built-in entities.
Duckling supports many languages, but most don't support all dimensions yet (we need your help!). Please look into this directory for language-specific support.
| Dimension | Example input | Example value output |
|---|---|---|
AmountOfMoney |
"42€" | {"value":42,"type":"value","unit":"EUR"} |
CreditCardNumber |
"4111-1111-1111-1111" | {"value":"4111111111111111","issuer":"visa"} |
Distance |
"6 miles" | {"value":6,"type":"value","unit":"mile"} |
Duration |
"3 mins" | {"value":3,"minute":3,"unit":"minute","normalized":{"value":180,"unit":"second"}} |
Email |
"duckling-team@fb.com" | {"value":"duckling-team@fb.com"} |
Numeral |
"eighty eight" | {"value":88,"type":"value"} |
Ordinal |
"33rd" | {"value":33,"type":"value"} |
PhoneNumber |
"+1 (650) 123-4567" | {"value":"(+1) 6501234567"} |
Position |
"first three" | {"span":3,"offset":0,"anchor":"start","type":"value"} |
Quantity |
"3 cups of sugar" | {"value":3,"type":"value","product":"sugar","unit":"cup"} |
Recurrence |
"every week" | {"week":1,"value":1,"anchor":null,"type":"value","times":1,"unit":"week","normalized":{"value":604800,"unit":"second"} |
Temperature |
"80F" | {"value":80,"type":"value","unit":"fahrenheit"} |
Time |
"today at 9am" | {"values":[{"value":"2016-12-14T09:00:00.000-08:00","grain":"hour","type":"value"}],"value":"2016-12-14T09:00:00.000-08:00","grain":"hour","type":"value"} |
Url |
"https://api.wit.ai/message?q=hi" | {"value":"https://api.wit.ai/message?q=hi","domain":"api.wit.ai"} |
Volume |
"4 gallons" | {"value":4,"type":"value","unit":"gallon"} |
Clinc note: Position and Recurrence are custom dimensions that only exist downstream.
Custom dimensions are also supported.
To regenerate the classifiers and run the test suite:
$ stack build :duckling-regen-exe && stack exec duckling-regen-exe && stack test
It's important to regenerate the classifiers after updating the code and before running the test suite.
To extend Duckling's support for a dimension in a given language, typically 4 files need to be updated:
Duckling/<Dimension>/<Lang>/Rules.hsDuckling/<Dimension>/<Lang>/Corpus.hsDuckling/Dimensions/<Lang>.hs(if not already present inDuckling/Dimensions/Common.hs)Duckling/Rules/<Lang>.hs
To add a new language:
- Make sure that the language code used follows the ISO-639-1 standard.
- The first dimension to implement is
Numeral. - Follow this example.
To add a new locale:
- There should be a need for diverging rules between the locale and the language.
- Make sure that the locale code is a valid ISO3166 alpha2 country code.
- Follow this example.
Rules have a name, a pattern and a production. Patterns are used to perform character-level matching (regexes on input) and concept-level matching (predicates on tokens). Productions are arbitrary functions that take a list of tokens and return a new token.
The corpus (resp. negative corpus) is a list of examples that should (resp. shouldn't) parse. The reference time for the corpus is Tuesday Feb 12, 2013 at 4:30am.
Duckling.Debug provides a few debugging tools:
$ stack repl --no-load
> :l Duckling.Debug
> debug (makeLocale EN $ Just US) "in two minutes" [Seal Time]
in|within|after <duration> (in two minutes)
-- regex (in)
-- <integer> <unit-of-duration> (two minutes)
-- -- integer (0..19) (two)
-- -- -- regex (two)
-- -- minute (grain) (minutes)
-- -- -- regex (minutes)
[Entity {dim = "time", body = "in two minutes", value = RVal Time (TimeValue (SimpleValue (InstantValue {vValue = 2013-02-12 04:32:00 -0200, vGrain = Second})) [] Nothing), start = 0, end = 14, latent = False, enode = Node {nodeRange = Range 0 14, token = Token Time TimeData{latent=False, grain=Minute, form=Nothing, direction=Nothing, holiday=Nothing, hasTimezone=False}, children = [Node {nodeRange = Range 0 2, token = Token RegexMatch (GroupMatch ["in"]), children = [], rule = Nothing},Node {nodeRange = Range 3 14, token = Token Duration (DurationData {value = 2, grain = Minute}), children = [Node {nodeR
ange = Range 3 6, token = Token Numeral (NumeralData {value = 2.0, grain = Nothing, multipliable = False, okForAnyTime = True}), children = [Node {nodeRange = Range 3 6, token = Token RegexMatch (GroupMatch ["two","","","",""]), children = [], rule = Nothing}], rule = Just "integer (0..19)"},Node {nodeRange = Range 7 14, token = Token TimeGrain Minute, children = [Node {nodeRange = Range 7 14, token = Tok
en RegexMatch (GroupMatch ["inutes","ute"]), children = [], rule = Nothing}], rule = Just "minute (grain)"}], rule = Just "<integer> <unit-of-duration>"}], rule = Just "in|within|after <duration>"}}]
Duckling is BSD-licensed.