Sciweavers

110 search results - page 2 / 22
» Parsing Ill-Formed Text Using an Error Grammar
Sort
View
EMNLP
2010
13 years 3 months ago
Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing
Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency gram...
Phil Blunsom, Trevor Cohn
ANLP
2000
97views more  ANLP 2000»
13 years 7 months ago
Spelling and Grammar Correction for Danish in SCARRIE
This paper reports on work carried out to develop a spelling and grammar corrector for Danish, addressing in particular the issue of how a form of shallow parsing is combined with...
Patrizia Paggio
EMNLP
2010
13 years 3 months ago
Unsupervised Parse Selection for HPSG
Parser disambiguation with precision grammars generally takes place via statistical ranking of the parse yield of the grammar using a supervised parse selection model. In the stan...
Rebecca Dridan, Timothy Baldwin
EMNLP
2010
13 years 3 months ago
Using Unknown Word Techniques to Learn Known Words
Unknown words are a hindrance to the performance of hand-crafted computational grammars of natural language. However, words with incomplete and incorrect lexical entries pose an e...
Kostadin Cholakov, Gertjan van Noord
CPP
2011
107views more  CPP 2011»
12 years 5 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge