We study pregroup grammars with letter promotions p(m) q(n) . We show that the Letter Promotion Problem for pregroups is solvable in polynomial time, if the size of p(n)
Abstract. Relational Grammar (RG) was introduced in the 70's as a theory of grammatical relations and relation change, for example, passivization, dative shift, and raising. F...
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
The graphical software Morph Moulder (MoMo) presented here was originally created for teaching the logical foundations of Head-Driven Phrase Structure Grammar (HPSG) in an e-Learn...
Statistical translation models that try to capture the recursive structure of language have been widely adopted over the last few years. These models make use of varying amounts o...