Sciweavers

IR
2010
13 years 9 months ago
Efficient algorithms for ranking with SVMs
RankSVM (Herbrich et al, 2000; Joachims, 2002) is a pairwise method for designing ranking models. SVMLight is the only publicly available software for RankSVM. It is slow and, due ...
Olivier Chapelle, S. Sathiya Keerthi
INLG
2010
Springer
13 years 9 months ago
The GREC Challenges 2010: Overview and Evaluation Results
There were three GREC Tasks at Generation Challenges 2010: GREC-NER required participating systems to identify all people references in texts; for GRECNEG, systems selected corefe...
Anja Belz, Eric Kow
ICGI
2010
Springer
13 years 9 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
EMNLP
2010
13 years 9 months ago
Top-Down Nearly-Context-Sensitive Parsing
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly ...
Eugene Charniak
EMNLP
2010
13 years 9 months ago
Collective Cross-Document Relation Extraction Without Labelled Data
We present a novel approach to relation extraction that integrates information across documents, performs global inference and requires no labelled text. In particular, we tackle ...
Limin Yao, Sebastian Riedel, Andrew McCallum
CIDU
2010
13 years 9 months ago
Optimal Partitions of Data In Higher Dimensions
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
Bradley W. Jackson, Jeffrey D. Scargle, Chris Cusa...
ICCPOL
2009
Springer
13 years 10 months ago
A Simple and Efficient Model Pruning Method for Conditional Random Fields
Conditional random fields (CRFs) have been quite successful in various machine learning tasks. However, as larger and larger data become acceptable for the current computational ma...
Hai Zhao, Chunyu Kit
IALP
2009
13 years 10 months ago
A Modular Cascaded Approach to Complete Parsing
In this paper, we propose a modular cascaded approach to data driven dependency parsing. Each module or layer leading to the complete parse produces a linguistically valid partial...
Samar Husain, Phani Gadde, Bharat Ram Ambati, Dipt...
IALP
2009
13 years 10 months ago
Two-Pass Deterministic Dependency Parsing for Long Chinese Sentences
This paper proposes a two-pass parsing approach to improve the performance of deterministic dependency parser for long Chinese sentences. In the first pass, the sentence is divided...
Ping Jian, Chengqing Zong
IALP
2009
13 years 10 months ago
Improved Reordering Rules for Hierarchical Phrase-Based Translation
Hierarchical phrase-based translation model has been proven to be a simple and powerful machine translation model. However, due to the computational complexity constraints, the ext...
Shu Cai, Yajuan Lü, Qun Liu