Marc Dymetman. A Generalized Greibach Normal Form for Definite Clause Grammars and the decidability of the offline-parsability problem, May 1991. Paper presented at the Second Meeting on the Mathematics of Lan- guage, Yorktown Heights, NY. (To be published) . Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Null-Headed Nominals in German and English - Nerbonne, Mullen (Correct)
.... and adjectives, and in turn, its presence requires at least some phonologically realized constituent to 3 The situation with more powerful theories is more complicated, but as long as there are not more than finitely many derivations of empty elements, they should be eliminable through compiling (Dymetman 1992). Null Headed Nominals in German and English 147 Subcat value of determiner Sample DP s [ LP ] which car(s) which blue one(s) which ones left which ff left [ LP :one] many cars many blue ones many ones left many ff left [ LP full] every car every blue one every one left every ff left [ ....
Dymetman, Marc (1992), A generalized Greibach normal form for definite clause grammars, in `Proc. of the 14th COLING', Nantes, France, pp. 366--372.
Inherently Reversible Grammars, Logic Programming and Computability - Dymetman (1991) (1 citation) Self-citation (Dymetman) (Correct)
....program, or it may be intrinsic to the grammar. If it is not intrinsic to the grammar, one may attempt some kind of program transformation on the grammar for qnstance a local transformation as goal reordering in clause bodies [4, 16] or a global transformation as left recursion elimination [5, 3] s in order to get a parsing program which displays a finite behavior. 4 If such a transformation is possible in principle, we say that, intrinsically, the grammar has a tintlely enumerable pars ing problem. 5 One.example of a class of grammars which respect this .crucial condition is provided ....
.... practice, this property does not necessarily entail that finding a program P to exploit will be obviousfi 4 For instance, offiine parsable grammars [9] can be shown to possess a finitely enumerable parsing problem, but algorithms which are able to make use of this property are by no means trivial [9, 13, 3]. 5 Discoverability If r is not finitely enumerable on 6P, it may still be discoverable on 6P. By definition, this means that it is possible to find a program P such that, for any given (ground) value of the p parameter, if there is no value y of the g parameter corresponding to , then the ....
Marc Dymetman. A Generalized Greibach Normal Form for Definite Clause Grammars and the decidability of the offline-parsability problem, May 1991. Paper presented at the Second Meeting on the Mathematics of Lan- guage, Yorktown Heights, NY. (To be published) .
A Symmetrical Approach to Parsing and Generation - Dymetman, Isabelle, Perrault (1990) (12 citations) Self-citation (Marc) (Correct)
....part of the previous definition is automatically satisfied by any program (P1) defined as above. The part, on the other hand, is not, but depends on further conditions on the refinement t of t. Saying that (PI) is a conservative extension of (P0) is tantamount to saying that (PI) adds some redundancy to (P0), which can be computationally exploited to constrain processing. Left recursion elimination 3. Program (Pl) is left recursive: in a top down interpretation, a call to a will result in another immediate call to a , and therefore will loop. On the olher hand the following program (P2) is not ....
....the program will terminate) 4. Parsing and generation in Lexical Grammar The rules of Fig. 3 are completely symmetrical in their specification of syntactic compositionality, 13 The general problem of left recursion elimination in I)CGs (including chain rule. and null rules lH78] is studied in [D90al; the existence of a Generalized Greibach Normal Form is proven, and certain decidabili U results are gJvell, 14 The (PI) P2) transformation is closely related In [ej corner par.ing [MTllMY83] which can in fact be recovered from this transformation through a certain encoding procedtu e (see ....
Dymetman, Marc. A Generalized Greibach Normal Form for Definite Clause Grammars. Laval, Qudbec: Minist&e des Communications Canada, Centre Canadieu de Recherche sur l'Informatisation du Travail.
A Simple Transformation for Offline-Parsable Grammars and its.. - Dymetman Self-citation (Dymetman) (Correct)
....at the core of the offline parsability concept. See note 3. 2 The concept of offline parsability (under a different name) goes back to [8] where it is shown to be linguistically relevant. 1 all solutions to the parsing problem and terminate. The existence of such a transformation is known: in [1, 2], we have recently introduced a Generalized Greibach Normal Form (GGNF) for DCGs, which leads to termination of top down interpretation in the OP case. However, the available presentation of the GGNF transformation is rather complex (it involves an algebraic study of the fixpoints of certain ....
Marc Dymetman. A Generalized Greibach Normal Form for Definite Clause Grammars. In Proceedings of the 15th International Conference on Computational Linguistics, volume 1, pages 366--372, Nantes, France, July 1992.
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