Tài liệu Báo cáo khoa học: "Efficient Parsing for Bilexical Context-Free Grammar sand Head Automaton Grammars*" pptx

... results for the natural formalism of bilexical context-free grammar, and for AI- shawi's (1996) head automaton grammars. For the usual case, split head automaton grammars or equivalent bilexical ... Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars* Jason Eisner Dept. of Computer ~ Information Science University of...

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

... following, cw is calculated for each noun. On the other hand, cw' is calculated for each combination of noun and its case information. Therefore, cw I is calculated for each ( noun, case ... (+ case information) but also verbs because verbs give important information about an action a user does in operating a system. As the third expan- sion, we use co-occurrence inform...

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

... new state-of-the-art semantic parsing model, propose a broader theory for tree transforma- tion based semantic parsing, and present a general inference algorithm for the tree transducer frame- work. ... a tree transformation based mapping, and (c) a tree trans- ducer that performs the mapping. volve tree transformations either between two trees or a tree and a string. The tree transduc...

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

... forward and backward combinator application. Adapted from Villavicencio (2002). 2 Background Combinatory Categorial Grammar (CCG, Steedman, 2000) is a lexicalised grammar formalism based on formal ... supertagging, on parsing accuracy. 1 Introduction Reranking techniques are commonly used for im- proving the accuracy of parsing (Charniak and John- son, 2005). Efficient decoding of a...

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

... information are both critical for high performance. To avoid a trade- off between these two, we need to increase parsing speed, but without losing accuracy. Parsing with lexicalised grammar formalisms, such ... gram- matical role, and a parsing stage that uses the tags to form a parse tree. Lexicalised grammars typ- ically contain a much smaller set of rules than phrase-structure gr...

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

... June 2008. c 2008 Association for Computational Linguistics Self-Training for Biomedical Parsing David McClosky and Eugene Charniak Brown Laboratory for Linguistic Information Processing (BLLIP) Brown ... al., 2006a; McClosky et al., 2006b). One possible use for this technique is for parser adaptation — initially training the parser on one type of data for which hand-labeled tr...

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

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

... transformed before grammar induc- tion, resulting in a transformed PCFG and look- ahead probabilities estimated in the standard way. Each parse returned by the parser was de- transformed for ... versus LC parsing. Naturally, an LC grammar performs best with our parser when right binarized, for the same reasons outlined above. We use transform composition to apply first one tra...

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

... is closely tied to the grammar of the parser; for it is the parsing grammar that specifies what sort of constituents count as the same for copying. For example, if the grammar did not treat ... the surface string (i.e., for transcripts, the orthographic string) before any syntactic proct i,~. For example, in (7), the underlined strings are expunged before parsing begin...

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

... partner. In contrast to other work on discourse parsing, we wish to use the parsing process directly for di- alog management (rather than for information ex- traction or summarization). This inuences ... to improved performance for any method. One utterance of context is best for shift-reduce and start-join; three is best for the connection path method. The shift- reduce method...

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