Learn More
  • Paul Kiparsky, Kristian Halvorsen, Elisabet Engdahl, Tan Fu, K P Mo-Hanan, Shuichi Yatabe +17 others
  • 2002
1 Issues in Binding Theory 1.1 Accounting for disjoint reference Obviation versus Blocking. Two approaches to the distribution of anaphors and pronominals have been explored in Binding Theory. The OBVIATION approach, originating in Lasnik 1976 and extensively developed in the GB tradition, posits autonomous disjoint reference principles which directly(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)
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)
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)
I present a complete calculus for mixed inference (van Benthem 1991) with composition and prove that it has the finite model property and is therefore decidable. I also present a variant of the calculus complete with respect to deterministic models, and mention the completeness and (un)decidability of other styles of inference involving composition,(More)
We show that the problems of parsing and surface realization for grammar formalisms with " context-free " derivations, coupled with Mon-tague semantics (under a certain restriction) can be reduced in a uniform way to Datalog query evaluation. As well as giving a polynomial-time algorithm for computing all derivation trees (in the form of a shared forest)(More)