F. Pereira and D. Warren. Definite clauses for language analysis. Artificial Intelligence, 13:231 -- 278, 1980.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....taking a right adjacent argulnent of type NP, to return a function taking a right adjacent argument of type PP, to return a function taking a left adjacent argument of type NP, to finally return an expression of the atomic type S. 1) put: NP) PP) NP The Definite Clause Grammar (DCG) framework [14] (see also [13] where phrase structure gram mars can be encoded as sets of definite clauses (which are themselves a subset of Horn clauses) and the forrealization of some aspects of it in [15] suggests a more expressive alternative to encode word order constraints in CG. Such an alterna tive ....

Pereira, Fernando C. N. and David II. D. Warren. 1980. Definite Clauses for Language Analysis. Artificial Intelligence. 13. pp231- 278.

....into the formalism of Horn clauses programs [5] Our grammar is implemented in Prolog with semantics attributes connected to C libraries for pattern recognition and decomposition. Moreover the translation from grammar to Prolog can be automatically done by a Definite Clause Grammar parser [7, 5, 19]. Because of the complex space shape of information, a high level language of description is required. We propose to use a two dimensional extension of DCG we choose to implement in Prolog [18] This higher order extension of Prolog has been shown in [13] to be well suited to write DCG parsers. ....

....allowing procedure parameters (logical variables) to be both input and output or to remain unbound. Unification replaces the conditionals and assignments which exist in most languages. The implementation of the grammar is directly derived from works concerning DCG (Definite Clause Grammars) [7, 5, 19]. 3.1 One Simple Rule: BeamedNote Prolog is really appropriate to implement a recursive descent analyzer for the language generated by a grammar. We want to transform a grammar rule into a Prolog program. As an example, we present the translation of the BeamedNote rule of the grammar: ....

F.C.N. Pereira and D.H.D. Warren. Definite clauses for language analysis. Artificial Intelligence, 13:231--278, 1980.

....gap is the subject of married ) This modal distinction between these two kinds of noun phrases is not addressed naturally using intuitionistic logic. The small logic program in Figure 9 illustrates how linear contexts can be used to solve these problems. Here, a definite clause grammar (DCG) [28] style presentation of a parser is used. Each category of the grammar, such as sent for sentence, vp for verb phrase, sbar for complement clauses, etc. is given two additional arguments, denoting a difference list of words. The rule for relative clauses (rel) introduces a gap, namely the formula ....

Fernando C. N. Pereira and David H. D. Warren. Definite clauses for language analysis. Artificial Intelligence, 13:231 -- 278, 1980.

.... [4] Second, it was discovered that a formalism of context free grammar rules augmented with uninterpreted first order attributes and logical constraints was very powerful and could be straightforwardly translated into the formalism of Horn clauses programs (DCG for Definite Clause Grammars [3, 2, 15]) In this setting, the interpreter of Horn clause programs serves as a recognising automaton. Though the Horn clause formalism is computationally complete [9, 16] many attempts are made to extend it in order to gain more flexibility or expressiveness. One of these attempts is Prolog [10] Among ....

F.C.N. Pereira and D.H.D. Warren. Definite clauses for language analysis. Artificial Intelligence, (13):231--278, 1980.

....p, q and r are undefined symbols, the inputo predicate produces the following term: unknown X X (unknown Y Y (symbol p Z (symbol q U (symbol r V ( Z X) U X Y) V Y) 70 CHAPTER 6. LIBRARIES 6. 6 Definite Clause Grammars The formalism of Definite Clause Grammars (DCG [12, 33]) allows to define context free grammars [1] extended with attribute and programmed conditions) that are easily transformed in a Prolog program that implements a recursive descent analyser for the language generated by the grammar. Module dcg defines the constructors of the DCG formalism. They ....

F.C.N. Pereira and D.H.D. Warren. Definite clauses for language analysis. Artificial Intelligence, 13:231--278, 1980.

....grammars that are executable, because they are simply a variant of a class of Prolog programs. DCGs also facilitate the handling of semantic information by allowing nonterminal symbols to include arguments, and Prolog goals to appear on the right hand side of rules. DCGs were introduced in [Pereira and Warren 1980], their ancestry being traceable to Colmerauer s Metamorphosis Grammars [Colmerauer 1978] Every good book on Prolog contains a section or chapter on DCGs, and so it will be assumed that the reader is familiar with them [Sterling and Shapiro 1986; O Keefe 1990] There are several problems with ....

Pereira, F.C.N. and Warren, D.H.D. 1980. Definite Clauses for Language Analysis, In Artificial Intelligence, 13, pp.231-278.

....has connections with Computational Linguistics at both the syntactic level and the semantic level. Logic Programming, via Prolog, can be considered as a by product of studies on automating the analysis of natural language [11] The relationship was refined through the notion of Logic Grammars [48, 1], but eventually natural language formalisms became more sophisticated independently. We are now at a stage in which more sophisticated natural language grammar formalisms like Generalized Phrase Structure Grammar (GPSG [22] have no clear counterpart in Prolog, the standard incarnation of Logic ....

....its very beginning. It was discovered that a formalism of context free grammar rules augmented with uninterpreted first order attributes and logical constraints is very powerful and can be straightforwardly translated into the formalism of Horn clauses programs (DCG for Definite Clause Grammars [12, 8, 48]) In this setting, the interpreter of Horn clause programs serves as a recognizing automaton. The formalism of context free grammars is in itself unable to express in detail the syntax of either programming or natural languages. It only offers us a fair compromise between precision in the ....

[Article contains additional citation context not shown here]

F.C.N. Pereira and D.H.D. Warren. Definite clauses for language analysis. Artificial Intelligence, 13:231-- 278, 1980.

....has connections with Computational Linguistics at both the syntactic level and the semantic level. Logic Programming, via Prolog, can be considered as a by product of studies on automating the analysis of natural language [10] The relationship was refined through the notion of Logic Grammars [46, 1], but eventually natural language formalisms became more sophisticated independently. We are now at a stage in which more sophisticated natural language grammar formalisms like Generalized Phrase Structure Grammar (GPSG [21] have no clear counterpart in Prolog, the standard incarnation of Logic ....

....its very beginning. It was discovered that a formalism of context free grammar rules augmented with uninterpreted first order attributes and logical constraints is very powerful and can be straightforwardly translated into the formalism of Horn clauses programs (DCG for Definite Clause Grammars [11, 7, 46]) In this setting, the interpreter of Horn clause programs serves as a recognizing automaton. The formalism of context free grammars is in itself unable to express in detail the syntax of either programming or natural languages. It only offers us a fair compromise between precision in the ....

[Article contains additional citation context not shown here]

F.C.N. Pereira and D.H.D. Warren. Definite clauses for language analysis. Artificial Intelligence, 13:231--278, 1980.

....deterministic) recursive descent analysis. The problem is that these well known transforms are only formally described for pure CFGs. Users of ACFGs are condemned to hand crafting the transformation. Moreover, the best established formalism for Logical Grammars, the Definite Clause Grammars (DCGs [9, 4]) is usually associated to recursivedescent analysis via a simple translation into Prolog. For instance, the following DCG rules (0 c denotes the code of character c ) exp(E P) exp(E) 0 ] prod(P) 1) exp(P) prod(P) are usually translated into the following Prolog ....

F.C.N. Pereira and D.H.D. Warren. Definite clauses for language analysis. Artificial Intelligence, 13:231--278, 1980.

....a high level language of description is required. Our grammar is implemented in Prolog [18] with semantics attributes connected to C libraries for pattern recognition and decomposition. Moreover the translation from grammar to Prolog can be automatically done by a Definite Clause Grammar parser [6, 5, 19]. We propose to use a two dimensional extension of DCG which we choose to implement in Prolog. This higher order extension of Prolog has been shown in [13] to be well suited to write DCG parsers. The system is already able to recognize full scores with up to two voices per staff, and to correct ....

....3 Implementation of the Grammar with Prolog We present in this section how the grammar is implemented with Prolog, a dialect of Prolog. Hence, the obtained Prolog program is a parser. The implementation of the grammar is directly derived from works concerning DCG (Definite Clause Grammars) [6, 5, 19]. 3.1 Prolog Prolog [17] is a higher order extension of Prolog where first order terms are replaced by typed terms. The first comment about this extension is to say that it is not a functional one; the terms will not be used to evaluate but only to encode. Prolog is a good candidate to handle ....

F.C.N. Pereira and D.H.D. Warren. Definite clauses for language analysis. Artificial Intelligence, 13:231--278, 1980.

....Ann believes that married Bob is incorrect (the gap is the subject of married ) The modal distinction between these two kinds of noun phrases is not addressed naturally using intuitionistic logic. The small logic program in Figure 14 is a simple parser based on definite clause grammars (DCG) (Pereira and Warren, 1980) extended with some uses of linear logic. Each category of the grammar, such as sent for sentence, vp for verb phrase, sbar for complement clauses, etc. is given two arguments, denoting a difference list of words. The rule for relative clauses (rel) introduces a gap by loading the formula all ....

Pereira, F. C. N., and Warren, D. H. D. (1980). Definite Clauses for Language Analysis. Artificial Intelligence, 13, 231 -- 278.

No context found.

F. Pereira and D. Warren. Definite clauses for language analysis. Artificial Intelligence, 13:231 -- 278, 1980.

No context found.

F. Pereira and D. Warren. Definite clauses for language analysis. Artificial Intelligence, 13:231 -- 278, 1980.

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