2750 search results - page 26 / 550 » Learning Efficient Parsing |
100
click to vote
COLING
2008
15 years 3 months ago
2008
In this paper, we focus on the adaptation problem that has a large labeled data in the source domain and a large but unlabeled data in the target domain. Our aim is to learn relia...
103
click to vote
ACL
2003
15 years 3 months ago
2003
We present a probabilistic parsing model for German trained on the Negra treebank. We observe that existing lexicalized parsing models using head-head dependencies, while successf...
104
click to vote
ACL
1998
15 years 3 months ago
1998
The multiplicative fragment of linear logic has found a number of applications in computational linguistics: in the "glue language" approach to LFG semantics, and in the...
105
click to vote
COLING
1994
15 years 3 months ago
1994
A CYK-table-driven interactive relaxation parsing method of spoken Korean, integrated with the CYK-based morphological analysis is introduced. An extension of the Categorial Gramm...
117
Voted
ACL
2010
15 years 14 days ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...