Originally conceived as a "naive" baseline experiment using traditional n-gram language models as classifiers, the NCLEANER system has turned out to be a fast and lightw...
In recent years, there has been a growing interest in using rich representations such as relational languages for reinforcement learning. However, while expressive languages have ...
Tom Croonenborghs, Jan Ramon, Hendrik Blockeel, Ma...
An examination of some recent programming texts indicates that the complexities of modern programming languages and environments have replaced the study of algorithms and programm...
To support rule-writers, we are developing techniques to automatically analyze large number of public comments on proposed regulations. A document is analyzed in various ways incl...
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...