Báo cáo khoa học: "Semi-Supervised Frame-Semantic Parsing for Unknown Predicates" doc

Tài liệu Báo cáo khoa học: "Head-Driven Parsing for Word Lattices" ppt

Tài liệu Báo cáo khoa học: "Head-Driven Parsing for Word Lattices" ppt

... 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
  • 8
  • 382
  • 0
Báo cáo khoa học: "Head-driven Parsing for Lexicalist Grammars: Experimental Results" ppt

Báo cáo khoa học: "Head-driven Parsing for Lexicalist Grammars: Experimental Results" ppt

... argues that head-corner parsing is especially useful for parsing with non-concatenative grammar formalisms. In [Lavelli and Satta, 1991] a head-driven parsing strategy for Lexicalized Tree Adjoining ... step, thus leading to inferior performance. Bottom-up parsing is far more attractive for lexi- calist formalisms, as it is driven by the syntactic in- formation associate...
Ngày tải lên : 09/03/2014, 01:20
  • 10
  • 188
  • 0
Báo cáo khoa học: "Bi-Directional Parsing for Generic Multimodal Interaction" pot

Báo cáo khoa học: "Bi-Directional Parsing for Generic Multimodal Interaction" pot

... 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 ability to constrain the search using cross-modal information as early as possible. CLAVIUS is the result of an effort to combine sensing technologies for se...
Ngày tải lên : 23/03/2014, 18:20
  • 6
  • 222
  • 0
Báo cáo khoa học: "Immediate-Head Parsing for Language Models£" potx

Báo cáo khoa học: "Immediate-Head Parsing for Language Models£" potx

... ones for which the trigram model performs better, and the ones for which the grammar model does better. We then collect labeled precision and recall statistics (the stan- dard parsing performance ... 137.26 for the Roark parser/trigram combination). In both papers the interpolation constants were 0.36 for the trigram estimate and 0.64 for the grammar estimate. While both of these...
Ngày tải lên : 31/03/2014, 04:20
  • 8
  • 285
  • 0
Báo cáo khoa học: "Head Corner Parsing for Discontinuous Constituency Gertjan van Noord" pptx

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

... 1983) and can be used for grammars written in power- ful formalisms such as non-concatenative versions of HPSG (Pollard, 1984; Reape, 1989). 1 Introduction Although most formalisms in computational ... order to be used for this larger class of grammars. The disadvan- tages Kay noted for his parser do not carry over to this generalized version, as redundant search paths for CF...
Ngày tải lên : 31/03/2014, 06:20
  • 8
  • 129
  • 0
Tài liệu Báo cáo khoa học: "Conditional Random Fields for Word Hyphenation" docx

Tài liệu Báo cáo khoa học: "Conditional Random Fields for Word Hyphenation" docx

... available for choosing values for these parameters. For En- glish we use the parameters reported in (Liang, 1983). For Dutch we use the parameters reported in (Tutelaers, 1999). Preliminary informal ... per- formance expected when hyphenating unknown words, i.e. rare future words. However, in real documents common words appear repeatedly. Therefore, the second less- standard experim...
Ngày tải lên : 20/02/2014, 04:20
  • 9
  • 607
  • 0
Báo cáo khoa học: "Polarity Consistency Checking for Sentiment Dictionaries" docx

Báo cáo khoa học: "Polarity Consistency Checking for Sentiment Dictionaries" docx

... assignment γ for a network N is a function from W ∪ S to the set P. Let γ be a polarity assignment for N. We say that γ is consistent if it satisfies the following condition for each w ∈ W: For p ∈ ... logic formulas, we can reduce it to C(s) = ¬s + ∨ ¬s − (1) For each word w with polarity p ∈ {−, +, 0 } in D we need a clause C(w, p) that states that w has polarity p. So, the Boolean...
Ngày tải lên : 07/03/2014, 18:20
  • 9
  • 333
  • 0
Báo cáo khoa học: "A Compositional Semantics for Focusing Subjuncts" doc

Báo cáo khoa học: "A Compositional Semantics for Focusing Subjuncts" doc

... operators for the focusing subjunct 7 (see below). 3.3 The sentential operators The sentential operators for only and even are given below. (The one for too is the same as that for even, ... sentence in its internal Prolog format. Secondly, the GPSG category obtained for the sen- tence, which incorporates a parse tree for the sen- tence, is displayed. For the sake...
Ngày tải lên : 08/03/2014, 18:20
  • 8
  • 304
  • 0
Báo cáo khoa học: "A Flexible Architecture for Reference Resolution" docx

Báo cáo khoa học: "A Flexible Architecture for Reference Resolution" docx

... turns input text ~ format into standard format for discourse referents. Coreference [Semantic type matching 1 nalysis for [lbr pronouns J efinite NPS Hobbs naive lagreement for | algorithm ... especially problematic for designers of dialogue systems trying to pre- dict how anaphora resolution techniques devel- oped for written monologue will perform when adapted for s...
Ngày tải lên : 08/03/2014, 21:20
  • 4
  • 279
  • 0
Báo cáo khoa học: "A Programming Language for Mechanical Translation" doc

Báo cáo khoa học: "A Programming Language for Mechanical Translation" doc

... of several formats. Format S (specifiers) in- volves whole constituents, including symbols and subscripts. Format A is for text, and in- volves only symbols. Both format S and for- mat A ... that calls for reading in format S from a designated channel, the next constituent from the input is brought into the workspace where it replaces the designated numbered constituent. For ex...
Ngày tải lên : 16/03/2014, 19:20
  • 17
  • 214
  • 0

Xem thêm

Từ khóa: