Learn More
We offer a simple, effective, and scalable method for statistical machine translation parameter tuning based on the pairwise approach to ranking (Herbrich et al., 1999). Unlike the popular MERT algorithm (Och, 2003), our pairwise ranking optimization (PRO) method is not limited to a handful of parameters and can easily handle systems with thousands of(More)
What do we want to learn from a translation competition and how do we learn it with confidence? We argue that a disproportionate focus on ranking competition participants has led to lots of different rankings, but little insight about which rankings we should trust. In response, we provide the first framework that allows an empirical comparison of different(More)
Extended top-down tree transducers (transducteurs g en eralis es descendants [Arnold, Dauchet: Bi-transductions de for^ ets. ICALP'76. Edinburgh University Press. 1976]) received renewed interest in the eld of Natural Language Processing. Here those transducers are extensively and systematically studied. Their main properties are identied and their relation(More)
Darwiche has recently proposed a graphical model for driving conditioning algorithms, called a dtree, which specifies a recursive decomposition of a directed acyclic graph (DAG) into its families. A main property of a dtree is its width, and it was shown previously how to convert a DAG elimination order of width w into a dtree of width ≤ w. The importance(More)
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to ensure cubic time decoding. For arbitrary SCFGs, this is typically accomplished via the synchronous binarization technique of (Zhang et al., 2006). A drawback to this approach is that it inflates the constant factors associated with(More)
We present a simple preordering approach for machine translation based on a feature-rich logistic regression model to predict whether two children of the same node in the source-side parse tree should be swapped or not. Given the pair-wise children regression scores we conduct an efficient depth-first branch-and-bound search through the space of possible(More)
In this paper, we study the problem of determining actual causes of events in specific scenarios, based on a definition of actual cause proposed by Halpern and Pearl. To this end, we explore two different search-based approaches, enrich them with admissible pruning techniques and compare them experimentally. We also consider the task of designing algorithms(More)
There are few data on the persistence of individual human immunodeficiency virus type 1 (HIV-1) transmitted drug resistance (TDR) mutations in the absence of selective drug pressure. We studied 313 patients in whom TDR mutations were detected at their first resistance test and who had a subsequent test performed while ART-naive. The rate at which mutations(More)