367 search results - page 47 / 74 » Lexicalized Context-Free Grammars |
ACL
1998
13 years 9 months ago
1998
The lexical acquisition system presented in this paper incrementallyupdates linguisticproperties of unknown words inferred from their surrounding context by parsing sentences with...
SCESM
2006
ACM
14 years 2 months ago
2006
ACM
The dynamic behavior of systems is best described by Finite-state machines. Generation of executable tests from behavioral models such as UML Statecharts offers benefits such as s...
ACL
1993
13 years 9 months ago
1993
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...
ACL
1990
13 years 9 months ago
1990
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
TCS
2010
13 years 6 months ago
2010
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...