877 search results - page 5 / 176 » How to Cover a Grammar |
ACL
1998
13 years 8 months ago
1998
This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' grammar using a left-corner grammar transform. The approximation i...
FOCS
2005
IEEE
14 years 29 days ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
EKAW
2006
Springer
13 years 11 months ago
2006
Springer
Robust mechanisms for ontology selection are crucial for the evolving Semantic Web characterized by rapidly increasing numbers of online ontologies and by applications that automat...
WIA
2007
Springer
14 years 1 months ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
ANLP
2000
13 years 8 months ago
2000
This paper describes a method for estimating conditional probability distributions over the parses of "unification-based" grammars which can utilize auxiliary distributi...