Veronica Dahl and Michael C. McCord. Treating Coordination in Logic Grammars. American Journal of Computational Linguistics, 9(2):69-91, 1983.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....type information, and historical knowledge about how the formula was gathered. The coordination transformation uses a compact representation technique called notation [19] to help organize clauses. The computational theory of coordination used in the transformation builds on the work of [12, 7]. The selection of tense and aspect depends on temporal information available in the temporal database model of [26] and on temporal interval relationships [1] This information enables the selection of allowable tenses using Hornstien s theory of tense [13] selection of aspectual feature values ....

V. Dahl and M. McCord. Treating coordination in logic grammar. American Journal of Computational Linguistics, 9(2):69--91, 1983.

....structures which are not handled. For example, the conjunction in What states border Texas and Oklahoma requires two instances of next to 2 which are both introduced by the word border. In general, satisfactory handling of conjunctions often requires special considerations in NLP systems (Dahl McCord, 1983), and no effort has been made to solve these problems in the context of Geoquery. The framework outlined here also does not allow the use of disjunction within queries to handle a sentence such as What states border Iowa or Missouri. Disjunction can be handled analogously to conjunction; ....

Dahl, V., & McCord, M. C. (1983). Treating coordination in logic grammars. American Journal of Computational Linguistics, 9 (2), 69--91.

....strategies, where syntactic structure of shared material is characterised more indirectly by the state of the parser. PROCESSING STRATEGIES There have been several attempts to treat coordination by adapting pre existing parsing strategies. For example, ATNs were adapted by Woods (1973) DCGs by Dahl and McCord (1983), and chart parsers by Haugeneder (1992) Woods and Dahl McCord s system are similar. Haugeneder s system has very limited coverage. In Wood s SYSCONJ system, the parser can back up to various points in the history of the parse, and parse the second conjunct according to the configuration found. ....

Dahl, V. and M.C. McCord (1983). Treating Coordination in Logic Grammars. Computational Linguistics, 9-2, p.69-91.

....type information, and historical knowledge about how the formula was gathered. The coordination transformation uses a compact representation technique called notation [23] to help organize clauses. The computational theory of coordination used in the transformation builds on the work of [7, 9]. The selection of tense and aspect depends on temporal information available in the temporal database model of [31] and on temporal interval relationships [1] This information enables the selection of allowable tenses using Hornstein s theory of tense [17] selection of aspectual feature values ....

V. Dahl and M. McCord. Treating coordination in logic grammar. American Journal of Computational Linguistics, 9(2):69--91, 1983.

....that metarule, general system operations, or second pass operations such as transformations, are needed for its formulation. Early attempts at such a general treatment [39, 4] were inefficient due to combinatorial explosion. A logic grammar rendition of coordination in terms of logic grammars [8] solved these inefficiencies through the addition of a semantic interpretation component that produced a logical form from the output of the parser and dealt with scoping problems for coordination. In the following example we show how the syntactic part of a metagrammatical treatment to ....

V. Dahl and M. McCord. Treating coordination in logic grammars. In American Journal of Computational Linguistics 9, pages 69--91, 1983.

....layer , and so on. Generally to derive the theorems of the next layer , at least one theorem produced at the previous stage must be used. This process terminates when no more new theorems can be generated. 2. 3 Coordination Early work on coordination proposed meta grammatical treatments (e.g. [12, 3]) in which the appearance of a coordinating word, or conjunction (e.g. and , or , but ) is treated as a demon. When a conjunction appears in a sentence of the form A X conj Y B a process is triggered in which backing up is done in the parse history in order to parse Y parallel to X, and B is ....

....a method in which parallel structures are detected and resolved through syntactic and semantic criteria, and which can be applied to either grammars using different semantic representations feature structure, calculus, or other. We exemplify using a logic based semantics along the lines of [3]. 4.1 Our semantico syntactic treatment of parallelism Let us now consider the string John drove the car through and demolished a window 0 1 2 3 4 5 6 7 8 9 where we have indicated the connections as numbers in between the words. We use the following grammar: sent(Sem) np(X,Scope,Sem) ....

[Article contains additional citation context not shown here]

V. Dahl and M. McCord. Treating coordination in logic grammars. American Journal of Computational Linguistics, 9:69--91, 1983.

....that metarule, general system operations, or second pass operations such as transformations, are needed for its formulation. Early attempts at such a general treatment [29, 4] were inefficient due to combinatorial explosion. A logic grammar rendition of coordination in terms of logic grammars [9] solved these inefficiencies through the addition of a semantic interpretation component that produced a logical form from the output of the parser and dealt with scoping problems for coordination. In the following example we show how the syntactic part of a metagrammatical treatment to ....

V. Dahl and M. McCord. Treating coordination in logic grammars. In American Journal of Computational Linguistics 9, pages 69--91, 1983.

....that metarule, general system operations, or second pass operations such as transformations, are needed for its formulation. Early attempts at such a general treatment [23, 3] were inefficient due to combinatorial explosion. A logic grammar rendition of coordination in terms of logic grammars [5] solved these inefficiencies through the addition of a semantic interpretation component that produced a logical form from the output of the parser and dealt with scoping problems for coordination. We next exemplify a metagrammatical treatment to coordination through AGs. Terminals are preceded by ....

V. Dahl and M. McCord. Treating coordination in logic grammars. In American Journal of Computational Linguistics 9, pages 69--91, 1983.

No context found.

Veronica Dahl and Michael C. McCord. Treating Coordination in Logic Grammars. American Journal of Computational Linguistics, 9(2):69-91, 1983.

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