I would like to know what exactly the mechanisms behind duckling are.
I am quite proficient in regular expressions though, and it seems duckling uses those in a more advanced way. The only explanation I have found so far is the following:
"Duckling is basically a regular expression on steroids. It does not do any approximation. If you are slightly familiar with Haskell, you can see how the bindings are created. It is indeed more advanced than a simple regular expression since you can create patterns for different variations of input."
I've already looked at the github project, but I am not experienced at all in haskell and a bit overwhelmed by all the code, to be honest.
I am especially interested in the 'time' and 'duration' dimensions, if you're about to give an explanation depending on an example.
But I am also grateful for any links or literature where my question may be explained.
