In this paper we discuss an approach to the semi-automatic classification of the compounds extracted from German corpora. Compound nominals are semi-automatically extracted from t...
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...
Esther M. Arkin, George Hart, Joondong Kim, Irina ...
The paper has two goals: firstly, we explain how ontology mapping formalisms can be used to denote the many interpretations of a given legal concept; secondly, we provide a short c...
Piotr Stolarski, Tadeusz Tomaszewski, John Zelezni...
Data driven POS tagging has achieved good performance for English, but can still lag behind linguistic rule based taggers for morphologically complex languages, such as Icelandic....
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...