Báo cáo khoa học: "AUGMENTED TRANSITION NETWORK GRAMMARS FOR GENERATION" potx

... AUGMENTED TRANSITION NETWORK GRAMMARS FOR GENERATION FROM SD£%NTIC NETWORKS Stuart C. Shapiro Department of Computer Science, SUNY at Buffalo I. YNTRODUCTYON Augmented transition network (ATN) grammars ... in the network is a PUSH to the parsing network. This network determines whether the inlmat is a statement (type D) or a question (type Q). If a statement, the net...

Ngày tải lên: 31/03/2014, 17:20

... forests. For completeness, we assume an extended form of the transition system where transitions take the form Σ 0 , Σ 1 , B, A, p, where p is a flag taking values in {0, 1} which equals 0 for ... graph G ∈ G for w, there is a transition sequence (c s (w), c 1 , . . . , c f ) such that g(c f ) = G. A transition system that is sound and complete for G is said to be correct for...

Ngày tải lên: 07/03/2014, 22:20

... of the proper- ties discovered of the network formed by the web hold also for the networks induced by semantic rela- tions in text mining applications, for various seman- tic classes, semantic ... more seeds for the next. They therefore treat the source text corpus as a network, in which words are the nodes and relations linking them are the edges. The re- sults of computational net...

Ngày tải lên: 30/03/2014, 21:20

... what information should be included in the text and what can be taken as read. Characteristics of the author may lead, for instance, to choices which give a particular perlocutionary force ... for a narrative ballad, inappropriate for a detective story. It is knowledge of types (a) and (e) which is encoded in the grammar of the Old French epic described below. A STORY GRAMMAR...

Ngày tải lên: 09/03/2014, 01:20

... AN ISLAND PARSING INTERPRETER FOR THE FULL AUGMENTED TRANSITION NETWORK FORMALISM John & Carroll University of Cambridge Computer Laboratory ... occurs in a sub -network, any action using that register in any higher sub -network that PUSHes for the one containing the LIFTR must be scoped so that the action is not performed in a right-to-left ... direction, i.e. against the...

Ngày tải lên: 09/03/2014, 01:20

... called application grammars. A resource grammar (Ranta, to appear) is a general-purpose grammar that forms a basis for application grammars. Resource grammars have so far been implemented for eleven ... because in GF all forms of a word are kept in the same declension table, which is convenient for generation, since GF is a generation-oriented grammar formalism. Therefore, the more...

Ngày tải lên: 20/02/2014, 12:20

... precompiling additional information, parsing can be broken down into recognition followed by parse recovery; • providing a formal treatment of the algo- rithms for transforming and minimising ... built up. For each action transition (the action, plus the start and finish states) we record the tree address that the transition reaches (we call this the action-site, or just a-sit...

Ngày tải lên: 20/02/2014, 18:20

... describe a technique for estimat- ing the parameters for this model using decision trees. The history-based grammar model provides a mechanism for taking advantage of contextual information from ... with information from dominat- ing constituents. All of these aspects of context are necessary for disambiguation, yet none is suf- ficient. We propose a probabilistic model of con...

Ngày tải lên: 20/02/2014, 21:20

... performance, with an LF of around 88.5%, in the settings of parsing time less than 500ms/sentence for Section 22. For comparison with previous studies using the packed parse forest, the performances ... investigate shift-reduce pars- ing approach for unification-based grammars without the mechanisms of the packed parse for- est. Shift-reduce parsing for CFG and dependen- cy pa...

Ngày tải lên: 22/02/2014, 02:20

... predicate of the form A i (α 1 , . . . , α dim(A i ) ) with A i ∈ N and α j ∈ (T ∪ V ) ∗ for 1 ≤ j ≤ dim(A i ). Central to RCGs is the notion of ranges on strings. Definition 2. For every w = w 1 . ... to instantiate a clause of the grammar, we need to find ranges for all variables in the clause and for all occurrences of terminals. For convenience, we assume the variables in a clause...

Ngày tải lên: 08/03/2014, 01:20