Báo cáo khoa học: "Sentence Planning as Description Using Tree Adjoining Grammar " pptx

... Sentence Planning as Description Using Tree Adjoining Grammar * Matthew Stone Christine Doran Department of Computer and Information ... rules out as many alternatives as possible. Our approach is to extend such NP planning procedures to apply to sentences, using TAG syntax and a rich semantics. Treating sentences as referring ... that combine pairs of trees, SUB...

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

... TAG by adjoining the relative clause into its wh-word as a predicative adjunct, and adjoining the wh-word into the parent noun phrase as a modifier, so the noun phrase is treated as an argument ... Synchronous Tree Adjoining Gram- mar (ISTAG) (Shieber, 1994; Shieber and Sch- abes, 1990), a variant of Tree Adjoining Gram- mar (Joshi, 1985) in which source and target e...

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

... Synchronous Tree- Adjoining Grammar A tree- adjoining grammar (TAG) consists of a set of elementary tree structures of arbitrary depth, which are combined by substitution, familiar from context- free grammars, ... auxil- iary tree in at an internal node in an elementary tree also labeled with nonterminal A. Trees without a foot node, which serve as a base for derivations, ar...

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

... encoded as a PDDL problem and how we can reconstruct an LTAG derivation from the plan. 2.1 Tree- adjoining grammars The grammar formalism we use here is that of lex- icalized tree- adjoining grammars ... elementary trees that are auxiliary trees also contain exactly one foot node, which is marked with an asterisk (∗). Trees that are not auxiliary trees are called initial trees. Elem...

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

... context-free grammar (CFG) that has exactly the same derivations. Included in this class of strongly context-free CCGs are a grammar including all the derivations in CCGbank and the grammar used ... supertagging ac- curacy, PARSEVAL measures and depen- dency accuracy. 1 Introduction Combinatory categorial grammar (CCG) is a vari- ant of categorial grammar which has attracted in- ter...

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

... to the similar tasks of para- phrase recognition (Malakasiotis, 2009) and tex- tual entailment (Hickl et al., 2006). Random Forests (Breiman, 2001) as well as other decision tree algorithms are ... Other misclassifications include verb tense modifications such as “is” → “was” and “consists” → “consisted”. These are difficult to 362 Comment Test Set Classified as Size Fluency Edits gram...

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

... the grammar. Even in lexi- calized grammars, there could be some auxiliary trees that are assigned some probability mass but which can never adjoin into another tree. Such auxiliary trees ... abilities assigned to trees are used only when the words anchoring the trees are used in a derivation. However, if the TAG allows non- lexicalized trees, or more precisely, auxiliary trees wit...

Ngày tải lên: 23/03/2014, 19:20

... syntactic and se- mantic formalisms assumed by SEMTAG namely, Feature-Based Lexicalised Tree Adjoining Gram- mar and L U . Tree Adjoining Grammars (TAG) TAG is a tree rewriting system (Joshi and ... two tree sets (a set of initial trees and a set of auxiliary trees) and (ii) two rewriting op- erations (substitution and adjunction). Furthermore, in a Lexicalised TAG, each tree ha...

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

... that goal. As part of a text generation research project, a grammar of English has been created and embodied in a computer program. This grammar and program, called Nigel, is intended as a component ... word name has an associated set of lexical features. Lexify selects items by word name; Classify and OutClassify operate on sets of items in terms of the lexicat features. 2.2...

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

... tree. As long as the termination condition isn't satisfied, at least one innermost tree must exist in the derivation tree. Returning to the invariant in the first step, in- nermost trees ... are used as described, e.g., in [Hopcroft, Ullman 79]). In 1975, the formalism of Tree Adjoining Gram- mars (TAGs) was introduced by Aravind K. Joshi, Leon S. Levy and Masako Ta...

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