Sciweavers

ACL
2008
13 years 5 months ago
Mining Wikipedia Revision Histories for Improving Sentence Compression
A well-recognized limitation of research on supervised sentence compression is the dearth of available training data. We propose a new and bountiful resource for such training dat...
Elif Yamangil, Rani Nelken
ACL
2008
13 years 5 months ago
Intrinsic vs. Extrinsic Evaluation Measures for Referring Expression Generation
In this paper we present research in which we apply (i) the kind of intrinsic evaluation metrics that are characteristic of current comparative HLT evaluation, and (ii) extrinsic,...
Anja Belz, Albert Gatt
ACL
2008
13 years 5 months ago
Robust Extraction of Named Entity Including Unfamiliar Word
This paper proposes a novel method to extract named entities including unfamiliar words which do not occur or occur few times in a training corpus using a large unannotated corpus...
Masatoshi Tsuchiya, Shinya Hida, Seiichi Nakagawa
ACL
2008
13 years 5 months ago
Exploiting N-best Hypotheses for SMT Self-Enhancement
Word and n-gram posterior probabilities estimated on N-best hypotheses have been used to improve the performance of statistical machine translation (SMT) in a rescoring framework....
Boxing Chen, Min Zhang, AiTi Aw, Haizhou Li
ACL
2008
13 years 5 months ago
Extracting a Representation from Text for Semantic Analysis
We present a novel fine-grained semantic representation of text and an approach to constructing it. This representation is largely extractable by today's technologies and fac...
Rodney D. Nielsen, Wayne Ward, James H. Martin, Ma...
ACL
2008
13 years 5 months ago
Event Matching Using the Transitive Closure of Dependency Relations
This paper describes a novel event-matching strategy using features obtained from the transitive closure of dependency relations. The method yields a model capable of matching eve...
Daniel M. Bikel, Vittorio Castelli
ACL
2008
13 years 5 months ago
Enforcing Transitivity in Coreference Resolution
A desirable quality of a coreference resolution system is the ability to handle transitivity constraints, such that even if it places high likelihood on a particular mention being...
Jenny Rose Finkel, Christopher D. Manning
ACL
2008
13 years 5 months ago
Partial Matching Strategy for Phrase-based Statistical Machine Translation
This paper presents a partial matching strategy for phrase-based statistical machine translation (PBSMT). Source phrases which do not appear in the training corpus can be translat...
Zhongjun He, Qun Liu, Shouxun Lin
ACL
2008
13 years 5 months ago
Mixture Model POMDPs for Efficient Handling of Uncertainty in Dialogue Management
In spoken dialogue systems, Partially Observable Markov Decision Processes (POMDPs) provide a formal framework for making dialogue management decisions under uncertainty, but effi...
James Henderson, Oliver Lemon