This paper presents a general platform, namely synchronous tree sequence substitution grammar (STSSG), for the grammar comparison study in Translational Equivalence Modeling (TEM)...
Min Zhang, Hongfei Jiang, Haizhou Li, AiTi Aw, She...
Lexical Attraction Models (LAMs) were first introduced by Deniz Yuret in (Yuret 1998) to exemplify how an algorithm can learn word dependencies from raw text. His general thesis i...
The goal of this work is to integrate query similarity metrics as features into a dense model that can be trained on large amounts of query log data, in order to rank query rewrit...
Fabio De Bona, Stefan Riezler, Keith Hall, Massimi...
A system making optimal use of available information in incremental language comprehension might be expected to use linguistic knowledge together with current input to revise beli...
We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an ...