Sciweavers

110 search results - page 13 / 22
» Parsing Ill-Formed Text Using an Error Grammar
Sort
View
IWPT
2001
13 years 9 months ago
High Precision Extraction of Grammatical Relations
A parsing system returning analyses in the form of sets of grammatical relations can obtain high precision if it hypothesises a particular relation only when it is certain that th...
John Carroll, Ted Briscoe
LREC
2010
152views Education» more  LREC 2010»
13 years 9 months ago
Grammar Extraction from Treebanks for Hindi and Telugu
Grammars play an important role in many Natural Language Processing (NLP) applications. The traditional approach to creating grammars manually, besides being labor-intensive, has ...
Prasanth Kolachina, Sudheer Kolachina, Anil Kumar ...
EMNLP
2009
13 years 5 months ago
Parser Adaptation and Projection with Quasi-Synchronous Grammar Features
We connect two scenarios in structured learning: adapting a parser trained on one corpus to another annotation style, and projecting syntactic annotations from one language to ano...
David A. Smith, Jason Eisner
AAAI
1990
13 years 8 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
ICDT
2010
ACM
147views Database» more  ICDT 2010»
13 years 11 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld