Search Sciweavers | Sciweavers

12

ACL
2003

169views Computational Linguistics» more ACL 2003»

13 years 6 months ago

We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...

Dan Klein, Christopher D. Manning

claim paper

Read More »

15

click to vote

ACL
2011

180views Computational Linguistics» more ACL 2011»

Effective Measures of Domain Similarity for Parsing

12 years 9 months ago

Download www.let.rug.nl

It is well known that parsing accuracy suffers when a model is applied to out-of-domain data. It is also known that the most beneﬁcial data to parse a given domain is data that ...

Barbara Plank, Gertjan van Noord

claim paper

Read More »

20

click to vote

ACL
2010

211views Computational Linguistics» more ACL 2010»

Efficient Inference through Cascades of Weighted Tree Transducers

13 years 3 months ago

Download www.isi.edu

Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...

Jonathan May, Kevin Knight, Heiko Vogler

claim paper

Read More »

21

click to vote

ACL
2008

174views Computational Linguistics» more ACL 2008»

A Critical Reassessment of Evaluation Baselines for Speech Summarization

13 years 6 months ago

Download www.aclweb.org

We assess the current state of the art in speech summarization, by comparing a typical summarizer on two different domains: lecture data and the SWITCHBOARD corpus. Our results ca...

Gerald Penn, Xiaodan Zhu

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers