Sciweavers

1242 search results - page 51 / 249
» The Theory of Grammar Constraints
Sort
View
ACL
1993
15 years 7 months ago
Parsing Free Word Order Languages in the Paninian Framework
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Akshar Bharati, Rajeev Sangal
IJCAI
1989
15 years 7 months ago
Layering Predictions: Flexible Use of Dialog Expectation in Speech Recognition
entional user behavior, we need a principled mannerAbstract for relaxing contextual constraints when they are violated.When computer speech recognition is used for problem In order...
Sheryl R. Young, Wayne H. Ward, Alexander G. Haupt...
IJAR
2008
116views more  IJAR 2008»
15 years 6 months ago
Portfolio management under epistemic uncertainty using stochastic dominance and information-gap theory
Portfolio management in finance is more than a mathematical problem of optimizing performance under risk constraints. A critical factor in practical portfolio problems is severe u...
Daniel Berleant, L. Andrieu, Jean-Philippe Argaud,...
PLDI
2010
ACM
16 years 3 months ago
A Context-free Markup Language for Semi-structured Text
An ad hoc data format is any non-standard, semi-structured data format for which robust data processing tools are not available. In this paper, we present ANNE, a new kind of mark...
Qian Xi, David Walker
ENTCS
2007
84views more  ENTCS 2007»
15 years 6 months ago
A Rewriting Logic Framework for Soft Constraints
Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences. Bistarelli, Montanari and Rossi have developed a ...
Martin Wirsing, Grit Denker, Carolyn L. Talcott, A...