Neural probabilistic language models (NPLMs) have been shown to be competitive with and occasionally superior to the widely-used n-gram language models. The main drawback of NPLMs...
To reduce the complexity of studying a parallel mechanism for natural language learning and understanding which supports both utterance and discourse processing, we propose a comp...
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Recently, Mikołaj Boja´nczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new c...
Abstract. We present the Tom language that extends Java with the purpose of providing high level constructs inspired by the rewriting community. Tom bridges thus the gap between a ...
Horatiu Cirstea, Pierre-Etienne Moreau, Antoine Re...