In machine translation, document alignment refers to finding correspondences between documents which are exact translations of each other. We define pseudo-alignment as the task of finding topical—as opposed to exact—correspondences between documents in different languages. We apply semisupervised methods to pseudo-align multilingual corpora. Specifically, we construct a topicbased graph for ea...

Predicting the quality of machine translations is a challenging topic. Quality estimation (QE) of translations is based on features of the source and target texts (without the need for human references), and on supervised machine learning methods to build prediction models. Engineering well-performing features is therefore crucial in QE modelling. Several features have been used so far, but the...

Let Sg,n be an orientable surface with genus g and n punctures. For simplicity, we shall drop the subscripts and denote it by S . The complex of curves C(S), is a locally infinite simplicial complex whose vertices are the isotopy classes of essential, non-peripheral, simple closed curves on S . A collection of vertices span a simplex if the curves can be isotoped to be disjoint or minimally int...

This paper is concerned with exploring efficient domain adaptation for the task of statistical machine translation, which is based on extracting sentence pairs (pseudo in-domain subcorpora, that are most relevant to the in domain corpora) from a large-scale general-domain web bilingual corpus. These sentences are selected by our proposed unsupervised phrase-based data selection model. Compared ...

This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the produced formula can be exponentially related to the size of the input constraint, but some important classes of pseudo-Boolean constraints, including Boolean cardinality constraints, are encoded in polynomial time and ...

the aim of this paper is to generalize the‎‎notion of pseudo-almost valuation domains to arbitrary‎ ‎commutative rings‎. ‎it is shown that the classes of chained rings‎ ‎and pseudo-valuation rings are properly contained in the class of‎ ‎pseudo-almost valuation rings; also the class of pseudo-almost‎ ‎valuation rings is properly contained in the class of quasi-local‎ ‎rings with linearly ordere...

In this work, we tackle the problem of language and translation models domainadaptation without explicit bilingual indomain training data. In such a scenario, the only information about the domain can be induced from the source-language test corpus. We explore unsupervised adaptation, where the source-language test corpus is combined with the corresponding hypotheses generated by the translatio...

Propositional modal provability logics like and have arithmetical interpretations where can be read as ‘formula is provable in Peano Arithmetic’. These logics are decidable but are characterized by classes of Kripke frames which are not first-order definable. By abstracting the aspects common to their characteristic axioms we define the notion of a formula generation map in one propositional va...