1064 search results - page 43 / 213 » Single Tree Grammars |
EACL
1993
ACL Anthology
13 years 9 months ago
1993
ACL Anthology
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
FBIT
2007
IEEE
14 years 2 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...
UAI
2004
13 years 10 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
ACL
2010
13 years 6 months ago
2010
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...
EMNLP
2010
13 years 6 months ago
2010
The task of selecting information and rendering it appropriately appears in multiple contexts in summarization. In this paper we present a model that simultaneously optimizes sele...