Recent work in end-to-end generation has reduced the need for knowledgeengineering, but is insufficiently sensitive to discourse structure. We present a method for inducing clause-combining rules for use in a traditional natural language generation architecture to address this gap. Our algorithm is able to learn all of the clause-combining rules present in the SPaRKy restaurant corpus from exem...

Computer models of case-based reasoning (CBR) generally guide case adaptation using a fixed set of adaptation rules. A difficult practical problem is how to identify the knowledge required to guide adaptation for particular tasks. Likewise, an open issue for CBR as a cognitive model is how case adaptation knowledge is learned. We describe a new approach to acquiring case adaptation knowledge. I...

Monte Carlo simulations in the grand canonical ensemble were used to obtain liquid-vapor coexistence curves and critical points of the pure uid and a binary mixture of Lennard-Jones particles. Critical parameters were obtained from mixedeld nite-size scaling analysis and subcritical coexistence data from histogram reweighting methods. The critical parameters of the untruncated Lennard-Jones pot...

To develop an approach to utilizing continuous statistical information within the Dempster- Shafer framework, we combine methods proposed by Strat and by Shafero We first derive continuous possibility and mass functions from probability-density functions. Then we propose a rule for combining such evidence that is simpler and more efficiently computed than Dempster's rule. We discuss the relatio...

The systematic use of hints in the learning-from-examples paradigm is the subject of this review. Hints are the properties of the target function that are known to use independently of the training examples. The use of hints is tantamount to combining rules and data in learning, and is compatible with different learning models, optimization techniques, and regularization techniques. The hints a...

We present extended term rewriting systems as a means to describe a simpliication relation for an equational speciication with a built-in domain of external objects. Even if the extended term rewriting system is canonical, the combined relation including built-in computations of`ground terms' needs neither be terminating nor connuent. We investigate restrictions on the extended term rewriting s...

Recent works have investigated the problem of the conflict redistribution in the fusion rules of evidence theories. As a consequence of these works, many new rules have been proposed. Now, there is not a clear theoretical criterion for a choice of a rule instead another. The present chapter proposes a new theoretically grounded rule, based on a new concept of sensor independence. This new rule ...

This paper presents the results of a set of preliminary experiments combining two knowledge-based partial dependency analyzers with two statistical parsers, applied to the Basque Dependency Treebank. The general idea will be to apply a stacked scheme where the output of the rule-based partial parsers will be given as input to MaltParser and MST, two state of the art statistical parsers. The res...