Learn More
We propose that the antecedent of a donkey pronoun takes scope over and binds the donkey pronoun, just like any other quantificational antecedent would bind a pronoun. We flesh out this idea in a grammar that compositionally derives the truth conditions of donkey sentences containing conditionals and relative clauses, including those involving modals and(More)
Parsing and generation (or surface realization) are two of the most important tasks in the processing of natural language by humans and by computers. In this paper, we study both tasks in the style of formal language theory. We show that the problems of parsing and surface realization for grammar formalisms with " context-free " derivations, coupled with a(More)
Second-order abstract categorial grammars (de Groote 2001) and hyperedge replacement grammars (see Engelfriet 1997) are two natural ways of generalizing " context-free " grammar formalisms for string and tree languages. It is known that the string generating power of both formalisms is equivalent to (non-erasing) multiple context-free grammars (Seki et al.(More)
We present a method for deriving an Ear-ley recognizer for multiple context-free grammars with the correct prefix property. This is done by representing an MCFG by a Datalog program and applying generalized supplementary magic-sets rewriting. To secure the correct prefix property, a simple extra rewriting must be performed before the magic-sets rewriting.(More)
It is proved that nite elasticity of language classes is preserved under the inverse image of a nite-valued relation, extending results of Wright's and of Moriyama and Sato's. Keywords and Phrases: nite elasticity, identiication in the limit, in-ductive inference, learnability. Note: In preparing the present note, the author was sponsored by project NF(More)