We investigate generalizations of the allsubtrees "DOP" approach to unsupervised parsing. Unsupervised DOP models assign all possible binary trees to a set of sentences ...
Abstract. In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that...
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Recent work has shown the promise in using local-search “probes” as a basis for directing a backtracking-based refinement search. In this approach, the decision about the next...
Alexander Nareyek, Stephen F. Smith, Christian M. ...