We improve the quality of paraphrases extracted from parallel corpora by requiring that phrases and their paraphrases be the same syntactic type. This is achieved by parsing the E...
We present parsing algorithms for various mildly non-projective dependency formalisms. In particular, algorithms are presented for: all well-nested structures of gap degree at mos...
We present some novel machine learning techniques for the identification of subcategorization information for verbs in Czech. We compare three different statistical techniques app...
In this paper, we present a class of algorithms that use a partial distance metric to speedup the motion estimation process. The partial distance metric is used within the motion ...
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...