Remo Pareschi. Type-driven Natural Language Analysis. PhD thesis, University of Edinburgh, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to provide a straightforward, perspicuous encoding of phrase structure grammars for parsing structures involving unbounded dependencies. The resulting grammars are closely related to the Generalized Phrase Structure Grammars of Gazdar [4, 5] This work builds on earlier work by Pareschi and Miller [24, 25]. Some of this work has been described previously in the proceedings of the 1992 JICSLP [9] and in the author s dissertation [10] The outline of this paper is as follows: In Section 2 we will review the basic principals of unbounded dependencies and their treatment in GPSG. In Section 3 we will ....

Remo Pareschi. Type-driven Natural Language Analysis. PhD thesis, University of Edinburgh, 1989.

....and Hodas ( Miller, 1990] Hodas and Miller, 1990] After briefly examining below the general issues involved in evaluating a programming language as a tool for a particular task, the paper continues as follows. The extensions of Prolog are presented in Section 2 ( Nadathur and Miller, 1988] [Pareschi, 1988]) Some uses of Prolog in natural language analysis are discussed in Section 3 ( Miller and Nadathur, 1986] and Section 4 ( Pareschi and Miller, 1990] In Section 5 a dissenting opinion ( Moore, 1989] is presented, with the rebuttal in [Pereira, 1990c] following in Section 6. Finally, in ....

....Prolog. This issue is examined in more detail in Section 7. 2.1 Hereditary Harrop Logic Hohh formulas extend Horn clause logic by allowing implications as goals and by permitting universally quantified goals. This can be shown by first defining the following class of firstorder formulas as in [Pareschi, 1988], where the syntactic variables A, D, and G range over atoms, definite clauses, and goals, respectively: ffl D : A j G oe A j 8xD j D 1 D 2 ffl G : A j G 1 G 2 j G 1 G 2 j 9xG If in this definition a non atomic definite clause G oe A is said to have a body G to the left of the implication ....

[Article contains additional citation context not shown here]

Remo Pareschi. Type-Driven Natural Language Analysis. PhD thesis, University of Edinburgh, 1988.

....student(jane) is a necessary entry Command: retract(student(jane) Command: necessary(student(X) student(jane) is a necessary entry Command: necessary(student(bob) Try again. Command: quit. Figure 8: A Session Using the Data Base Query Program ple natural language parsing example. In [23, 24] an intuitionistic context was used to manage the introduction and scoping of gaps. This approach, although modeling various aspects of gapping correctly, was unsatisfactory for at least two reasons. First, the phrase whom Bob married Ann would parse incorrectly as a relative clause. The ....

Remo Pareschi. Type-driven Natural Language Analysis. PhD thesis, University of Edinburgh, 1989.

....theorem proving. It would be interesting to see how structure sharing among derivations and incremental sentence processing could be integrated into the proof net approach. The use of a more general calculus of hypothetical reasoning, Hereditary Harrop Logic, has been proposed by Pareschi [23] [24]. Its generality is basically due to its structural rules of weakening, contraction and permutation, which are non existent in the Lambek calculus. However, it is exactly the effects of the structural rules which are then excluded via extra logical tools in order to make the logic appropriate for ....

....due to its structural rules of weakening, contraction and permutation, which are non existent in the Lambek calculus. However, it is exactly the effects of the structural rules which are then excluded via extra logical tools in order to make the logic appropriate for natural language parsing [24], 16] 5 Conclusion In this paper, the traditional concept of chart parsing has been adapted to a rather general variant of the extended categorial grammars, the so called Lambek categorial grammars. The new method has been described in terms of a set of inference rules which have been proved ....

Remo Pareschi. Type-Driven Natural Language Analysis. PhD thesis, University of Edinburgh, Edinburgh, Scotland, 1989.

.... (12) For this the added rule is essentially the deduction (meta)theorem: 13) Gamma; A ) B Gamma ) C DT Gamma ) B A) C Using this expanded formalism an attempt can be made to model filler gap dependencies by coding fronted elements such as relative pronouns with implicational clauses (cf. Pareschi 1989, Pareschi and Miller 1990) Thus, suppose we wish to state that [thatji] j is a relative clause if i k would be an S if j k was an N, i.e. that the body of a relative clause may be a sentence lacking an object at its right periphery. Then we may add (14) thatji] j: R 8k(i k: S ....

Pareschi, R.: 1989, Type-driven Natural Language Analysis, Ph.D. thesis, University of Edinburgh.

....way to specify any variations of the contraction rule for the object logic: arbitrary contraction on all hypotheses is imposed by the meta logic. ffl A proposed technique for parsing relative clauses is to first assume the existence of a noun phrase (a gap) and then attempt to parse a sentence (Pareschi, 1989). Intuitionistic contexts do not naturally enforce the constraint that the assumed gap must be used while parsing the relative clause and that the gap cannot appear in certain positions ( island constraints (Pereira and Shieber, 1987) ffl Intuitionistic contexts can be used to manage a data ....

....np P0 P2. vp P1 P2 : stv P1 P0, sbar P0 P2. sbar (that: P1) P2 : sent P1 P2. np P1 P2 : pn P1 P2. rel (whom: X) Y : all z (np z z) o sent X Y. pn (mary: L) L. pn (bob: L) L. pn (ann: L) L. tv (loves: L) L. tv (married: L) L. stv (believes: L) L. Figure 14: A simple parser for gaps in English (Pareschi, 1989; Pareschi and Miller, 1990) This approach, although modeling various aspects of gap threading correctly, is unsatisfactory for at least two reasons. First, the restriction that a gap, once introduced, must be used is not easy to enforce using an intuitionistic context. Therefore, the phrase ....

Pareschi, R. (1989). Type-driven Natural Language Analysis. Ph.D. thesis, University of Edinburgh.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC