Tài liệu Báo cáo khoa học: "A CONNECTIONIST PARSER FOR STRUCTURE UNIFICATION GRAMMAR" docx

... of Structure Unification Grammar, then present the parser design, and finally a sketch of its implementation. STRUCTURE UNIFICATION GRAMMAR Structure Unification Grammar is a formaliza- tion ... ABSTRACT This paper presents a connectionist syntactic parser which uses Structure Unification Grammar as its grammatical framework. The parser is im- plemented in a c...

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

... p null = 10 −10 for this value in the experiments we report below. 784 either φ P z i for phrase pairs or φ null for single lan- guage phrases. We choose Dirichlet process (DP) priors for these parameters: φ P z i ∼ ... induces a parallel tree structure and translation in the tar- get language (Chiang, 2007). Figure 1 shows an example derivation for Japanese to English trans- lati...

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

... into discussion of the under- lying complexity, for which we unfortunately do not have space here, we give an exter- nal form of a lexical entry for some of the senses of the German verb traeumen. ... presented in the form of a feature structure annotated with details of any con- straints which are still unresolved. 4.2.1. Discussion Designers of unification gram- mar for...

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

... incu- bated for 4 days with each of the peptides (10 lm), and cells were fixed and used for immunocytochemical analyses. Immunocytochemistry Neurons were fixed in 4% paraformaldehyde for 20 min at ... to transformed Ca 2+ -competent E. coli cells (ER2566) by heat shock. The transformed cells were spread on LB agar plates containing ampicillin (50 mgÆL )1 ), single colonies were picked fo...

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

... labelled information for training. Our sys- tem extracts transliteration pairs in an unsupervised fashion. It is also able to utilize labelled information if available, obtaining improved performance. We ... of the Association for Computational Linguistics, pages 469–477, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics A Statistical Model for...

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

... still rely on the surround- ing infrastructure for feature extraction and machine learning components. 3 Using BART Although BART is primarily meant as a platform for experimentation, it can be used ... standoff format of the MMAX2 annotation tool (M ¨ uller and Strube, 2006) with MiniDiscourse, a library that efficiently imple- ments a subset of MMAX2’s functions. Using a generic format...

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

... allows that use of future information in ad- dition to past information. The pipeline model nat- urally allows access to all the past information. Algorithm 3 Pseudo code for the look ahead algo- rithm. ... suc- cessful parsers, e.g. (Ratnaparkhi, 1997), in that the classifiers are trained on individual decisions rather than on the overall quality of the parser, and chained to yield the glo...

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

... general information about the system’s components, a description and time- stamp for each system event and user event, names and timestamps for the system-recorded sound files, and timestamps for ... Open-ended tasks prompted users to search for any type of information with any input modality. The tasks in the two sets paralleled each other. For example, if one set of tasks as...

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

... only for N’s small enough to yield non-zero P(n) scores. For test corpora of reasonable size, the metrics are usually well-defined for N≤4. The BLEU proposed by Papineni et al. (2002) for ... recall scores for increasingly longer n-grams. For test corpora of reasonable size, the metrics are usually well- defined for N≤4. The ROUGE metric proposed by Lin and Hovy (2003)...

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

... acquire more over time: we in- tend for it to generalize and encapsulate best practices, and serve as a testbed for new practices. Dyna is now be- ing used for parsing, machine translation, morphological analysis, ... probabilities, which permits heuristic early stopping before the agenda is empty. With viterbi values, it amounts to uniform-cost search for the best parse, and an item’...

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