Sciweavers

905 search results - page 11 / 181
» Parsing of Context-Sensitive Languages
Sort
View
ACL
2007
15 years 5 months ago
Generalizing Tree Transformations for Inductive Dependency Parsing
Previous studies in data-driven dependency parsing have shown that tree transformations can improve parsing accuracy for specific parsers and data sets. We investigate to what ex...
Jens Nilsson, Joakim Nivre, Johan Hall
GPCE
2007
Springer
15 years 8 months ago
Context-aware scanning for parsing extensible languages
This paper introduces new parsing and context-aware scanning algorithms in which the scanner uses contextual information to disambiguate lexical syntax. The parser uses a slightly...
Eric Van Wyk, August Schwerdfeger
117
Voted
EMNLP
2008
15 years 5 months ago
Two Languages are Better than One (for Syntactic Parsing)
We show that jointly parsing a bitext can substantially improve parse quality on both sides. In a maximum entropy bitext parsing model, we define a distribution over source trees,...
David Burkett, Dan Klein
125
Voted
AAAI
1990
15 years 5 months ago
Parsing a Natural Language Using Mutual Information Statistics
The purpose of this paper is to characterize a constituent boundary parsing algorithm, using an information-theoretic measure called generalized mutual information, which serves a...
David M. Magerman, Mitchell P. Marcus
138
Voted
ACL
1989
15 years 5 months ago
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
Sylvie Billot, Bernard Lang