Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
We use a strong form of the tree model property to boost the performance of resolution-based first-order theorem provers on the so-called relational translations of modal formulas...
Carlos Areces, Rosella Gennari, Juan Heguiabehere,...
We propose a structure called dependency forest for statistical machine translation. A dependency forest compactly represents multiple dependency trees. We develop new algorithms ...
Zhaopeng Tu, Yang Liu, Young-Sook Hwang, Qun Liu, ...
This article describes a new model of probability density function and its use in estimation of distribution algorithms. The new model, the distribution tree, has interesting prope...