Tài liệu Báo cáo khoa học: "AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION" docx

... AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION Alon Lavie School of Computer Science Carnegie Mellon University 5000 Forbes Ave., Pittsburgh, PA ... veloping an integrated heuristic scheme for selecting the parse that is deemed "best" from such a collection. We describe the heuristic measures used and their combi- nation scheme. ... thi...

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

... that the LinguaStream platform promotes the combination of purely declarative formalisms (when GATE is mostly based on the JAPE language and NOOJ focuses on a unique formalism), and allows processing ... analy- sis models and methodological concerns. Finally, when other platforms usually enforce the use of a dedicated document format, LinguaStream is able to process any XML document. On the o...

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

... competitive performance, even outperforms the Moses system over 0.3 BLEU points in some cases. Also, the syntax-based systems obtain very 6 The parse trees follow the nested bracketing format, ... of minimum error rate training that allows for various evaluation metrics for tuning the system. In addition, the toolkit provides easy-to-use APIs for the development of new feat...

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

... m j represents the jth mention (e.g., m 6 for the pronoun “he”). e i j represents the partial entity i before the jth mention. For example, e 1 6 denotes the part of e 1 before m 6 , i.e., {“Microsoft Corp.”, ... Given a test document, the mentions are processed one by one. For each encountered men- tion m j , a test instance is formed for each partial en- tity found so far, e i ....

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

... 3 Coding Scheme We will present our coding scheme by first describing the core DR/ scheme, followed by the adaptations for our corpus and research issues. For details about our scheme, see ... In order to use the core scheme, it is anticipated that each group will need to refine it for their particular purposes. A usable draft core scheme is now available for experiment...

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

... needed for construction of parse trees (or "derived trees" as they are often called for TAGs) and the computation of features are al- most identical to the corresponding extensions for ... satisfying: • CS(N) + C_ CS(N), for each N; • (N, L) • CS(N), for each N such that N <~* l, and each L • Af*; • N • CS(N), for each N such that -~(N<~*l); and • for...

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

... i := O; forall z E F do create uarae-concat¢~atoT'-Rmb age~| J~f i; N, ~= s*lve(x); i := i + 1; forellend for j := 0 to i do R := R U (Wait-lor-result(J~fj)); forend return ... of HPSG parsers implemented on PSTFS. One is designed for our Japanese grammar and the al- gorithm is a parallel version of the CKY algo- rithm (Kasami, 1965). The other is a parser for...

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

... arbitrary permutation of signs is input to a shift-reduce parser which tests them for grammatical well-formedness. If they are well-formed, the system halts indicating success. If not, another ... it is well-formed or ill-formed. • maximal iff it is well-formed and its parent (if it has one) is ill-formed. In other words, a maxi- mal TNCB is a largest well-formed component of a TNCB...

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

... citation context and then for each extracted sentence find a similar one in the original pa- per. Unfortunately, we did not have time to test this approach before the deadline for the camera-ready ... sen- sitivity of performance to these parameters. In gen- eral, for a wide range of values of these parameters, the performance is relatively stable and near opti- mal. Specifically, the per...

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

... of them for such compres- sions/expansions. We make the simplifying assump- tion that all such edits also retain the core mean- ing of the sentence, and are therefore valid training data for our ... compression, com- pactly encoding all compressions of a sentence in a forest structure. The forest ranking algorithm which extracts compressed parse trees, optimized the model scores as well...

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