Báo cáo khoa học: "Partial Parsing from Bitext Projections" pptx

... 1597–1606, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics Partial Parsing from Bitext Projections Prashanth Mannem and Aswarth Dara Language Technologies Research Center International ... earlier non- directional parsing works of Shen and Joshi (2008) and Goldberg and Elhadad (2010). We also pro- pose an extended partial parsing algorithm that...

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

... 2000. Some experiments on indicators of parsing com- plexity for lexicalized grammars. In Proceedings of the COLING Workshop on Efficiency in Large-scale Parsing Systems, pages 37–42, Luxembourg. Anoop ... 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 as Lexicalised...

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

... objects from Web text. We show that the novel, domain-independent sequence frame in SEQ substantially boosts the precision and recall of the system and yields coherent sequences fil- tered from low-precision ... extractions (x, k, s) from text, and then classifying those extractions as either cor- rect or incorrect. In the following section, we describe a way to identify candidate extrac...

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

... Michigan, June 2005. c 2005 Association for Computational Linguistics Minimalist Parsing of Subjects Displaced from Embedded Clauses in Free Word Order Languages Asad B. Sayeed Department of Computer ... involving the extraction of con- stituents, including subjects, from tensed embedded clauses. We make use of ideas about the left periphery from Rizzi (1997) to modify our parser in...

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

... corpora derived from WSJ and Brown, as well as those we collected from the web. 4 Data Sets for Evaluation and Training The appeal of unsupervised parsing lies in its abil- ity to learn from surface ... unsupervised incremental parsing. In ACL. V. I. Spitkovsky, H. Alshawi, and D. Jurafsky. 2010a. From Baby Steps to Leapfrog: How “Less is More” in unsuper- vised dependency parsing...

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

... XynA from C. cellulovorans (GH11-Doc- CE4) [35] and XynA from C. thermocellum strain ATCC27405 (GH11-CBM6-Doc-CE4) [33], or associ- ated with a CBM6 module such as in XynB (GH11- CBM6-Doc) from ... endoxylanase from a corn stalk rot strain of Erwinia chrysanthemi. Phytopathology 83, 332–338. 29 Keen NT, Boyd C & Henrissat B (1996) Cloning and characterization of a xylanase gene f...

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

... transducers, producing state-of-the-art semantic parsing re- sults while remaining applicable to any do- main employing probabilistic tree transducers. 1 Introduction Semantic parsing is the task of mapping natural ... three-fold: we present a new state-of-the-art semantic parsing model, propose a broader theory for tree transforma- tion based semantic parsing, and present a general in...

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

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

... to be the label of the node, which is either a terminal from E or the empty string e. For each other node N, label(N) is an element from NT. At a node N in a tree such that label(N) • NT ... N of some derived elementary tree; and (ii) t's root spans from position i to position j in w, t's foot node spans from posi- tion fl to position f2 in w. In case N does no...

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

... Ha can move from state q to state q~, matching symbol b and removing it from the left end of Zr. Symmetrically, if b is the rightmost symbol of zl and ql E 5a(q, b, ~ ) then from q Ha can ... time O(n4). We do this by providing a translation from head automaton grammars to bilexical CFGs. 4 This result improves on the head-automaton parsing algorithm given by Alshawi, which...

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