Báo cáo khoa học: "Head Corner Parsing for Discontinuous Constituency Gertjan van Noord" pptx

... Head Corner Parsing for Discontinuous Constituency Gertjan van Noord Lehrstuhl ffir Computerlinguistik Universit~t des Saarlandes Im Stadtwald 15 D-6600 Saarbrficken 11, FRG vannoord@coli.uni-sb.de ... parser for a class of gram- mars that handle discontinuous constituency by a richer notion of string combination than ordinary concatenation. The parser is a general...

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

... beam function, base beam value) for pars- ing using development test data consisting of strings for which we have annotated parse trees. The parsing accuracy for parsing word lattices was not directly ... the overparsing extension can be seen in Table 1. Each of the PARSEVAL measures improves when overparsing is used. 5.2 Parsing Lattices The success of the parsing model as a la...

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

... the parse forest for the left -corner and head -corner parser for a few (longer) sentences. tive items in the left -corner parser whereas no ac- tive items are asserted for the head -corner parser. ... complexity of a head -corner parser does not ex- ceed that of an Earley parser. [van Noord, 1991; van Noord, 1993] argues that head -corner parsing is especially useful...

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

... 85–90, Sydney, July 2006. c 2006 Association for Computational Linguistics Clavius: Bi-Directional Parsing for Generic Multimodal Interaction Frank Rudzicz Centre for Intelligent Machines McGill University Montr ´ eal, ... the main advantages of MMI - the ability to constrain the search using cross-modal information as early as possible. CLAVIUS is the result of an effort to combine...

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

... beam-search algorithm for decoding. 1 http://www.statmt.org/moses/ 162 Therefore, we do incorporation by performing par- tial matching for phrase translation before decod- ing. The advantage is that ... Association for Computational Linguistics Partial Matching Strategy for Phrase-based Statistical Machine Translation Zhongjun He 1,2 and Qun Liu 1 and Shouxun Lin 1 1 Key Laboratory of...

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

... results over baseline performance, but local expansion decreases performance by introduc- ing irrelevant terms. In (4) retrieval performance is improved over the baseline for both expansion tech- niques. ... question-answer database. Evaluation was performed by manual labeling of top 20 answers retrieved for each of 60 queries for each system by two independent judges. For the sake of...

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

... presented with some previously unseen test data, we are forced to rely on its automatic parse trees. However, for the best re- sults we should take advantage of gold parse trees whenever possible, including ... from human labels annotated in NomBank. For argument identification, we invent the follow- ing 20 binary unobservable auxiliary problems to take advantage of information previously...

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

... must be unambiguous. Therefore, while this model dis- ambiguates CPs of the form (nl p n2 cc n3), it trains from implicitly unambiguous CPs of the form (n ccn). For example: - Wn-x is the ... able for training. Such a model is useful only for languages in which annotated corpora are available. Because an unsupervised model does not rely on such corpora it may be modified for...

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

... K8E did not restore complex formation. Only the left solution is consistent with this information. (B) TBE virus envelope glycoprotein E trimer (CAPRI target 10), for which epitope, conservation ... ‘shape’ information into which the structures of known constituents of a complex can be fitted. Cryo-electron microscopy has been used for a large number of yeast complexes [115] and for the...

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

... the performance for different feature di- mensions, we use Chi-squared feature selection al- gorithm (Forman, 2003) to select 10K and 30K fea- tures. The averaged message length is 54.1 for 10K features ... within Hamming radius 2 for hash lookup. We find that IL outperforms SH since SH fails for many queries. It also shows that S 3 H (with FCC) can obtain the best precision for all...

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