Sciweavers

ACL
2010
13 years 10 months ago
Learning to Adapt to Unknown Users: Referring Expression Generation in Spoken Dialogue Systems
We present a data-driven approach to learn user-adaptive referring expression generation (REG) policies for spoken dialogue systems. Referring expressions can be difficult to unde...
Srinivasan Janarthanam, Oliver Lemon
ACL
2010
13 years 10 months ago
Sentiment Learning on Product Reviews via Sentiment Ontology Tree
Existing works on sentiment analysis on product reviews suffer from the following limitations: (1) The knowledge of hierarchical relationships of products attributes is not fully ...
Wei Wei, Jon Atle Gulla
ACL
2010
13 years 10 months ago
Hindi-to-Urdu Machine Translation through Transliteration
We present a novel approach to integrate transliteration into Hindi-to-Urdu statistical machine translation. We propose two probabilistic models, based on conditional and joint pr...
Nadir Durrani, Hassan Sajjad, Alexander Fraser, He...
ACL
2010
13 years 10 months ago
Towards Open-Domain Semantic Role Labeling
Current Semantic Role Labeling technologies are based on inductive algorithms trained over large scale repositories of annotated examples. Frame-based systems currently make use o...
Danilo Croce, Cristina Giannone, Paolo Annesi, Rob...
ACL
2010
13 years 10 months ago
SystemT: An Algebraic Approach to Declarative Information Extraction
As information extraction (IE) becomes more central to enterprise applications, rule-based IE engines have become increasingly important. In this paper, we describe SystemT, a rul...
Laura Chiticariu, Rajasekar Krishnamurthy, Yunyao ...
ACL
2010
13 years 10 months ago
Learning Phrase-Based Spelling Error Models from Clickthrough Data
This paper explores the use of clickthrough data for query spelling correction. First, large amounts of query-correction pairs are derived by analyzing users' query reformula...
Xu Sun, Jianfeng Gao, Daniel Micol, Chris Quirk
ACL
2010
13 years 10 months ago
A Tree Transducer Model for Synchronous Tree-Adjoining Grammars
A characterization of the expressive power of synchronous tree-adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is...
Andreas Maletti
ACL
2010
13 years 10 months ago
Simple, Accurate Parsing with an All-Fragments Grammar
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...
Mohit Bansal, Dan Klein
ACL
2010
13 years 10 months ago
Open Information Extraction Using Wikipedia
Information-extraction (IE) systems seek to distill semantic relations from naturallanguage text, but most systems use supervised learning of relation-specific examples and are th...
Fei Wu 0003, Daniel S. Weld
ACL
2010
13 years 10 months ago
Computing Weakest Readings
We present an efficient algorithm for computing the weakest readings of semantically ambiguous sentences. A corpus-based evaluation with a large-scale grammar shows that our algor...
Alexander Koller, Stefan Thater