39 search results - page 2 / 8 » Two Equivalent Regularizations for Tree Adjoining Grammars |
87
Voted
EACL
1993
ACL Anthology
15 years 29 days ago
1993
ACL Anthology
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that ther...
98
Voted
COLING
2010
14 years 6 months ago
2010
Surface realisation with grammars integrating flat semantics is known to be NP complete. In this paper, we present a new algorithm for surface realisation based on Feature Based T...
117
Voted
FBIT
2007
IEEE
15 years 6 months ago
2007
IEEE
—Standard genetic programming genotypes are generally highly disorganized and poorly structured, with little code replication. This is also true of existing developmental genetic...
ACL
1990
15 years 24 days ago
1990
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
CSB
2004
IEEE
15 years 3 months ago
2004
IEEE
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...