Tài liệu Báo cáo khoa học: "Transition-based parsing with Confidence-Weighted Classification" pdf

... a pattern with which to expand it and then filling out that pattern with words drawn from a unigram distribution. This kind of coupled generative process can be naturally formalized with tree ... accuracy (the percentage of sentences with correct answers), as well as F1: the harmonic mean of precision (the proportion of correct answers out of sentences with a parse) and recall (the p...

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

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

... Relevance of Lexicalization to Parsing. In Proceedings of the 1st International Workshop on Parsing Technologies. Pittsburgh, PA. To also appear under the title: Parsing with Lexicalized Tree Adjoining ... grammatical information within lexical items. Notably, the association between elementary trees and anchors improves also parsing performance, as will be discussed below....

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

... one. A pair s = (I left , I right ) with a left and a right interface is called a state. We partition the hypothe- ses associated with span p into sets compatible with the same state. In practice, ... on the training data is estimated with respect to the de- velopment data. We obtain an error rate of 2.67% on the test data. With deterministic search, or beam with B = 1, we obtain...

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

... Internet where it occurs. 2. From all of the pages within a site, gather the features that occur within ten words of an oc- currence of a k , with any particular feature in- cluded at most once. ... review is a strongly positive indication. 5 4.4 Methods with Supervision As demonstrated in Section 3.3, each anchor word a k is associated with a coefficient γ k . In unsu- pervised models,...

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

... 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 Tree Adjoining ... parser must consider; second, each further pass is as costly as parsing a whole extra sentence. Our goal is to increase parsing speed without loss of accuracy. The technique we use is...

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

... Structure Grammar. University of Chicago Press. Y. Schabes, A. Abeill@, and A. Joshi. 1988. Parsing strategies with 'lexicalized' grammars: Applica- tion to Tree Adjoining Grammars. In Proceedings ... ends. An- notating our left half-constituents with s makes this check possible. 9 Final remarks We have formally described, and given faster parsing algorithms for, thr...

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

... current node ends with an edit signal. As a result, the first window element is popped into another dimension, leaving the the parser data structures in the state shown in Figure 2. Parsing of the ... rules never replace one element with another or insert an element in the parser data structures. However, both replacements and insertions can be accomplished within the self-correctio...

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

... research that are relevant to our work: work on parsing (written and spoken) discourse, and work on plan-based dialog models. Discourse Parsing Discourse parsing is the pro- cess of building a hierarchical ... con- siderable work on discourse parsing using statisti- cal bottom-up parsing (Soricut and Marcu, 2003), hierarchical agglomerative clustering (Sporleder and Lascarides, 2004...

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

... PR with the V32I mutation; PR I50V , PR with the I50V mutation; PR I54M , PR with the I54M mutation; PR I54V , PR with the I54V mutation; PR I84V , PR with the I84V mutation; PR L90M , PR with ... compared with PR WT –SQV. (B) PR I50V –APV compared with PR I50V –SQV. (C) PR I54M –APV compared with PR I54M –SQV. (D) PR I54V –APV compared with PR I54V –SQV. (E) PR I84V –APV...

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