Sciweavers

1519 search results - page 40 / 304
» The Domain Dependence of Parsing
Sort
View
NAACL
2003
15 years 7 months ago
Supervised and unsupervised PCFG adaptation to novel domains
This paper investigates adapting a lexicalized probabilistic context-free grammar (PCFG) to a novel domain, using maximum a posteriori (MAP) estimation. The MAP framework is gener...
Brian Roark, Michiel Bacchiani
SETN
2010
Springer
16 years 13 days ago
A Feasibility Study on Low Level Techniques for Improving Parsing Accuracy for Spanish Using Maltparser
In the last years dependency parsing has been accomplished by machine learning–based systems showing great accuracy but usually under 90% for Labelled Attachment Score (LAS). Mal...
Miguel Ballesteros, Jesús Herrera, Virginia...
157
Voted
COLING
2010
15 years 18 days ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
FLAIRS
2008
15 years 8 months ago
Learning to Assess Low-Level Conceptual Understanding
This paper analyzes the impact of several lexical and grammatical features in automated assessment of students' finegrained understanding of tutored concepts. Truly effective...
Rodney D. Nielsen, Wayne Ward, James H. Martin
180
Voted
CLIN
2000
15 years 7 months ago
Alpino: Wide-coverage Computational Analysis of Dutch
Alpino is a wide-coverage computational analyzer of Dutch which aims at accurate, full, parsing of unrestricted text. We describe the head-driven lexicalized grammar and the lexic...
Gosse Bouma, Gertjan van Noord, Rob Malouf