F. Pereira and D. Warren, "Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks", Artificial Intelligence 13(3), 231--278 (1980).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....(in the worst case) 5.3 Avoiding expansion to DNF Most of the systems which are currently used to implement unification based grammars depend on an expansion to disjunctive normal form in order to compute with disjunctive descriptions. 2 Such systems are exemplified by Definite Clause Grammar [10], which eliminates disjunctive terms by multiplying rules which contain them into alternative clauses. Kay s parsing procedure for Functional Unification Grammar [8] aisc requires expanding functional descriptions to DNF before they are used by the parser. This expansion may not create much of a ....

....of coping with this complexity. It should be possible to augment this logic to include characterizations of negation and implication, which we are now developing. It may also be worthwhile to integrate the logic of feature struc tures with other grammatical formalisms based on logic, such as DCG [10] and LFP [13] ....

Pereira, F. C. N. and D. H. D. Warren. Defi- nite clause grammars for language analysis - a survey of the formalism and a comparison with augmented transition networks. Arts- cial Intelligence, 13:231-278, 1980.

....ambiguity and uncertainty exist at the different levels of analysis. To resolve the ambiguity and uncertainty, the related knowledge sources should be properly represented and integrated. Conventional approaches to case identification usually need a lot of human efforts to encode ad hoc rules [1,2,3]. Such a rule based system is, in general, very expensive to construct and difficult to maintain. In contrast, a statistics oriented corpus based approach achieves disambiguation by using a parameterized model, in which the parameters are estimated and tuned from a training corpus. In such a way, ....

F. C. N. Pereira and D. G. D. Warren. "Definite clause grammar for language analysis - a survey of the formalism and a comparison with augmented transition networks." Artificial Intelligence, 13(3): 231-278, 1980.

....hater dictimtay rc kence altd also tamilcs cm, p imuted idiom: wRh versatility. Conscqnen ly, the atiiiza.tion of , o.tgl; A g [or pa,cticaJ p azposes ha,s become fesi ble. So fax, a, vc)a 19 aremar tbzmalimn bvsed ca logic progzam. mhtg pa; l:gm sach a,s Metamoqlto,s Gtalama [2] nd ICC. [9] ha, e been pseseatc In Mcta, torpho;is each grammar ;nit is ;anslated into a I[oa (Jlanse, nd the ) mlog ial, c0etc pa ses the inpnt smttence with these ilorn Clanse nai ,tg a top .dowel ; ltd depth. tmt strategy. 0 alike in the past wlmm pa, sers had to be constr ,cted for syntactic ....

F. Peteira and D. Warren. Definite clause grammar for language analysis- a survey of the formalism and a comparison with augmented transition networks. Artificial Intelligence, 13(3):231-278, 1980.

....Uses of Higher Order Logic in Computational Linguistics Dale A. Miller and Gopalan Nadathur Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 3897 Abstract Consideration of the question of meaning in the framework of linguistics often requires an allusion to sets and other higher order notions. The traditional approach to representing and reasoning about meaning in a computa tional setting has been to use knowledge representation ....

....into logical forms. As an example, consider translating the sentence Every man loves a woman to the logical form Vx(man(x) D 3y(woman(y) loves(x,l) which in our context will be represented by the A term (all X(man X = some Y(woman Y loves X Y) A higher order version of a DCG [10] for performing this task is provided below. This DCG draws on the spirit of Montague Grammars. See [11] for a similar example. sentence (P1 P2) np (P1 P2) np P nora P nom X(P1 X P2 X) vp x(P2 (P1 x) vpP rell P np Pl, vp P2, determ Pl, nom P2. propernoun P. noun ....

[Article contains additional citation context not shown here]

F. C. N. Peteira, D. H. D. Warren, "Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Tran- sition Networks" in Artificial Intelligence 13 (1980).

....the phrase structure component provides for inductive definition (or, from the computational point of view, recursion) the constraint logic can be kept decidable. Two types of constraint logics have been used in unification grammar formalisms. The constraint logic of Definite Clause Grammars [36] is identical with the constraint logic of Prolog and consists of first order equations interpreted in the free term algebra. The other type of constraint logic, which evolved with the now predominant feature based unification grammars, is based on the notion of features and has only recently ....

F. C. Pereira and D. H. Warren. Definite clause grammars for language analysis--- a survey of the formalism and a comparison with augmented transition networks. Artificial Intelligence, 13:231--278, 1980.

....next states or failures to do so indicate the syntactic admissibility of the next word. Another candidate is the context free grammar, preferably augmented by the addition of complex syntactic semantic features as in GPSG (General Phrase Structure Grammar) 17] or DCL (Definite Clause Grammar [18]. Such extensions of a context free grammar provide for the parsimonious expression of various types of syntactic agreement and a means of semantic interpretation. We have opted instead for a simple context free grammar (CFG) syntactic component for several reasons. First, it is simpler than its ....

Pereira, Fernando C. N., and Warren, David H. D. "Definite Clause Grammars for Language Analysis: A Survey of the Formalism and a Comparison with Augmented Transition Networks." Artificial Intelligence 13 (1980): 231-278.

....program would be, making it easier to verify its correctness and also easier to understand directly. Logic programming has been applied mostly to formal software specifications, data base systems and problem solving, but it is being applied increasingly to natural language understanding systems [1,2,4,5,6]. In these systems axioms specify the relationship between the input text and whatever representation it is to be parsed into, and between this and whatever the output is to be (e.g. an updated database or the answer to a question) Since these axioms specify the relation between the text and its ....

Pereira, F.C.N., and Warren, D.H.D. Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks. Artificial Intelligence 13, 3, (May 1980), 231-278.

....is one which prevents it from converging on a single definition of some words. 2 Background In [15] Rayher et al. describe a system which can determine the lexical category of each word in a corpus of sentences. They observe that while in the original formulation, a definite clause grammar[12] normally defines a two argument predicate paxzer( antence, Txee) with the lexicon rePresented directly in the clauses of the grammar, an alternative formulation would alIow the lexicon to be represented explicitly as an additional argument to the parserrelatlon, yielding a three argument ....

Fernando C. N. Pereira and David H. D. Warren. Definite clause grammars for language analysis--a survey of the formalism and a com- parison with augmented transition networks. Artificial Intelligence, 13(3):231-278, 1980.

....is one which prevents it from converging on a single definition of some words. 2 Background In [15] Rayner et al. describe a system which can determine the lexical category of each word in a corpus of sentences. They observe that while in the original formulation, a definite clause grammar[12] normally defines a two argument predicate parser(Sentence,Tree) with the lexicon represented directly in the clauses of the grammar, an alternative formulation would allow the lexicon to be represented explicitly as an additional argument to the parser relation, yielding a three argument ....

Fernando C. N. Pereira and David H. D. Warren. Definite clause grammars for language analysis---a survey of the formalism and a comparison with augmented transition networks. Artificial Intelligence, 13(3):231--278, 1980.

....category and unification based grammar and their properties relevant to this paper. The present version of our parser works with grammars written using PATR II formalism but, with minor changes, it can work using similar unification based grammar formalisms such as definite clause grammars [12], functional unification grammars or lexicalfunctional grammars . The application subtools which deal with structured categories (unification, grammar compilation) are precisely delimited. Therefore any change into these subtools will probably not affect other parts; moreover, the input ....

Perreira, F., Warren, D., - "Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks" in Artificial Intelligence, 13, 23178, 1980.

....situations in practical applications, novel deductive systems call for the usage of a unique method that includes all advantages of the various specialized techniques. 1.3. Related work The analogies between chain queries and context free languages were investigated by several authors, including [7, 2, 9, 10, 25, 32, 33]. In particular, the use of automata to compute general logic queries was first proposed by Lang [18] Lang s method is based on pushing facts from the database onto the stack for later use in reverse order in the proof of a goal. As the method applies to general queries, it is not very e#ective ....

F.C.N. Pereira, and D.H.D. Warren. Definite Clause Grammars for Language Analysis - A Survey on the Formalism and a Comparison with Augmented Transition networks. Artificial Intelligence, No. 13, 1980, pages 231--278.

.... linguistic theories, such as Lexical Functional Grammar [24] Functional Unification Grammar [25] Generalized Phrase Structure Grammar [26] Unification Categorial Grammar [27, 28] Head Driven Phrase Structure Grammar [29] Definite Clause Grammars [30] and Lexicalized Tree Adjoining Grammar [31], make use of lexical and semantic properties by using feature structures [32, 33] As Johnson [32] points out, these feature structures are specified indirectly in terms of constraints that they must satisfy. For example, in English a verb and its subject must agree in number. Thus, while both ....

Fernando C. N. Pereira and David H. D. Warren. Definite clause grammars for language analysis-a survey of the formalism and a comparison with augmented transition networks. Artificial Intelligence, 13(3):231-278, 1980.

....it permits that planning progress in a forward direction while the system is reasoning backward, from goal to subgoals. That is progression. This kind of representational strategy is not new. It has been at the core of a well known device for specifying grammars: Definite Clause Grammar or DCG [13]. REACTIVE PASCAL programs are like DCGs in that they are a sort of higher level macros that can be completely and unambiguously translated into logic programs. Unlike DCG however, REACTIVE PASCAL provides for negative literals. Also, and this is a critical difference, in DCG the state of the ....

F.C.N. Pereira and D.H.D. Warren. Definite clause grammars for language analysis-a survey of the formalism and a comparison with augmented transition networks. Artificial Intelligence, 13:231--278, 1980.

....effort, one can give both a semantics for a new language and a procedure for translating it into the interlingua. In this paper, we describe a language translation methodology in which one specifies the semantics of a new representation language using a special kind of definite clause grammar [Pereira Warren 80] that we call a definite clause translation grammar (DCTG) This grammar can be used to translate top level forms in the new language into an interlingua. A DCTG is a set of Horn clauses that has a distinguished binary predicate symbol TRANS such that if s 1 is a top level form in the new ....

F. C. N. Pereira and D. H. D. Warren; "Definite Clause Grammars for Language Analysis -- A Survey of the Formalism and a Comparison with Augmented Transition Networks, Artificial Intelligence , 13, pp. 231-278, 1980.

....It is argued that certain important linguistic phenomena, collectively known in transformational grammar as left extra position, can be described better in XGs than in earlier grammar formalisms based on definite clauses. The XG formalism is an extension of the definite clause grammar (DCG) [6] formalism, which is itself a restriction of Colmerauer s formalism of metamorphosis grammars (MGs) 2] Thus XGs and MGs may be seen as two alternative extensions of the same basic formalism, DCGs. The argument for XGs will start with a comparison with DCGs. I should point out, however, that ....

....them in a clear and concise manner. This is the purpose of XGs. 2. Grammars in Logic This section summarises the concepts of definite clause grammars (DCGs) and of the underlying sys tem of logic, definite clauses, needed for the rest of the paper. A fuller discussion can be found elsewhere [6]. A definite clause has either the form P: QI, Qn to be read as P is true if Q q . Qn are true , or the form P. to be read as P is true . P is the head of the clause, l . n are goals, forming the body of the clause. The symbols P, 1 . n stand for literals. A literal has a ....

Pereira, F. and Warren, D. H. D. "Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks." Artificial Intelligence 13 (1980) 231-278.

No context found.

F. Pereira and D. Warren, "Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks", Artificial Intelligence 13(3), 231--278 (1980).

No context found.

F. Pereira et. al., "Definite Clause Grammars for Language Analysis --a Survey of the Formalism and a Comparison with Augmented Transition Networks," Artificial Intelligence, 13:231-278, 1980.

No context found.

F. Pereira et. al., "Definite Clause Grammars for Language Analysis --a Survey of the Formalism and a Comparison with Augmented Transition Networks," Artificial Intelligence, 13:231-278, 1980.

No context found.

F. Pereira and D. H. D. Warren. Definite clause grammars for language analysis---a survey of the formalism and a comparison with augmented transition networks. Journal of Artificial Intelligence, 13(3):231--278, 1980.

No context found.

F. Pereira, D. Warren, Definite clause grammars for language analysis---A survey of the formalism and a comparison to augmented transition networks, Artificial Intelligence 13 (1980) 231--278.

No context found.

Pereira, F.C.N. and Warren, D.H.D.: Definite Clause Grammars for Language Analysis: a Survey of the Formalism and Comparison with Augmented Transition Networks. Artificial Intelligence, vol. 13, no. 3 (1980).

No context found.

Pereira, F.C.N. and Warren, D.H.D.: Definite Clause Grammars for Language Analysis -- A Survey of the Formalism and Comparison with Augmented Transition Networks. Artificial Intelligence, N. 13, (1980) pp. 231-278.

No context found.

Pereira,F. et.al: Definite Clause Grammar for Language Analysis --A Survey of the Formalism and a Comparison with Augmented Transition Networks. Artificial Intelligence, 13, 231-278 (1980).

No context found.

Poreira, F., and Warren, I).[I.D., p"Definite Clause Grammars for Language Analysis - A survey of the FormMism and a Comparison with Augmented Transition Networks", Artificial lnl. clligen(:c, vol. 13, no. 3, 1980.

No context found.

F. C. N. Pereira, D. H. D. Warren. Definite Clause Grammars for Language Analysis--A survey of the Formalism and a Comparison with Augmented Transition Networks. Artificial Intelligence, Vol 13, pp 231-278, North-Holland 1980

First 50 documents  Next 50

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