We are concerned with dependencyoriented morphosyntactic parsing of running text. While a parsing grammar should avoid introducing structurallyunresolvable distinctionsin order to...
We propose an architecture for the organisation of linguistic knowledge which allows to (1) separately formulate generalizations for different types of linguistic information, and...
Martin C. Emele, Ulrich Heid, Stefan Momma, R&eacu...
Computational models of meaning trained on naturally occurring text successfully model human performance on tasks involving simple similarity measures, but they characterize meani...
Marco Baroni, Brian Murphy, Eduard Barbu, Massimo ...
We describe a nilpotent quotient algorithm for a certain type of infinite presentations: the so-called finite L-presentations. We then exhibit finite L-presentations for various i...
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...