We propose a top-down algorithm for extracting k-best lists from a parser. Our algorithm, TKA is a variant of the kbest A (KA) algorithm of Pauls and Klein (2009). In contrast to ...
We investigate a recently proposed Bayesian adaptation method for building style-adapted maximum entropy language models for speech recognition, given a large corpus of written la...
We establish the following characteristics of the task of perspective classification: (a) using term frequencies in a document does not improve classification achieved with absenc...
Beata Beigman Klebanov, Eyal Beigman, Daniel Dierm...
Building an accurate Named Entity Recognition (NER) system for languages with complex morphology is a challenging task. In this paper, we present research that explores the featur...
Yassine Benajiba, Imed Zitouni, Mona T. Diab, Paol...
In hierarchical phrase-based SMT systems, statistical models are integrated to guide the hierarchical rule selection for better translation performance. Previous work mainly focus...
Lei Cui, Dongdong Zhang, Mu Li, Ming Zhou, Tiejun ...
Nivre's method was improved by enhancing deterministic dependency parsing through application of a tree-based model. The model considers all words necessary for selection of ...
This paper presents a general-purpose open source package for recognizing Textual Entailment. The system implements a collection of algorithms, providing a configurable framework ...
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...
Most supervised language processing systems show a significant drop-off in performance when they are tested on text that comes from a domain significantly different from the domai...