Báo cáo khoa học: "Simple, Accurate Parsing with an All-Fragments Grammar" potx

Báo cáo khoa học: "Simple, Accurate Parsing with an All-Fragments Grammar" potx

Báo cáo khoa học: "Simple, Accurate Parsing with an All-Fragments Grammar" potx

... Is Biased and Inconsistent. In Computational Linguis- tics 28(1). Dan Klein and Christopher Manning. 2003. Accurate Unlexicalized Parsing. In Proceedings of ACL. Philipp Koehn, Franz Och, and Daniel ... De- pendencies and Structural Relations. In Proceedings of ACL. Andreas Zollmann and Khalil Sima an. 2005. A Consistent and Efficient Estimator for Data-Oriented Parsing. Journal of Automat...
Ngày tải lên : 23/03/2014, 16:20
  • 10
  • 316
  • 0
Tài liệu Báo cáo khoa học: "Transition-based parsing with Confidence-Weighted Classification" pdf

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

... time and the effect of pruning when using confidence-weighted learn- ing. 2 Transition-based parsing Transition-based parsing builds on the idea that parsing can be viewed as a sequence of transitions between ... confidence-weighted classification in transition-based parsing gives results comparable to using SVMs with faster training and parsing time. We also compare with other onl...
Ngày tải lên : 20/02/2014, 04:20
  • 6
  • 493
  • 0
Báo cáo khoa học: "Efficient Parsing with Linear Context-Free Rewriting Systems" pdf

Báo cáo khoa học: "Efficient Parsing with Linear Context-Free Rewriting Systems" pdf

... Thorten Brants, and Hans Uszkoreit. 1997. An annotation scheme for free word order languages. In Pro- ceedings of ANLP, pages 88–95. Andreas van Cranenburgh, Remko Scha, and Federico Sangati. 2011. ... two German treebanks (Maier and Søgaard, 2008; Maier and Lichte, 2009). Re- cent work on treebank parsing with discontinuous constituents (Kallmeyer and Maier, 2010; Maier, 2010; Evang an...
Ngày tải lên : 08/03/2014, 21:20
  • 11
  • 437
  • 0
Báo cáo khoa học: "Bitext Dependency Parsing with Bilingual Subtree Constraints" docx

Báo cáo khoa học: "Bitext Dependency Parsing with Bilingual Subtree Constraints" docx

... Dependency parsing For dependency parsing, there are two main types of parsing models (Nivre and McDonald, 2008; Nivre and Kubler, 2006): transition-based (Nivre, 2003; Yamada and Matsumoto, 2003) and ... information, which is useful in parsing, than a usual monolingual texts that can be called “bilin- gual constraints”, and we expect to obtain more accurate parsing results that can...
Ngày tải lên : 16/03/2014, 23:20
  • 9
  • 236
  • 0
Báo cáo khoa học: "Improving Dependency Parsing with Semantic Classes" pot

Báo cáo khoa học: "Improving Dependency Parsing with Semantic Classes" pot

... lexical semantics into a parser significantly improves its performance. This work presented the first results over both WordNet and the Penn Treebank to show that semantic processing helps parsing. ... positive effect. Regarding dependency parsing of the English PTB, currently Koo and Collins (2010) and Zhang and Nivre (2011) hold the best results, with 93.0 and 92.9 unlabeled atta...
Ngày tải lên : 17/03/2014, 00:20
  • 5
  • 246
  • 0
Báo cáo khoa học: "Language-Independent Parsing with Empty Elements" docx

Báo cáo khoa học: "Language-Independent Parsing with Empty Elements" docx

... 1999), and was recently applied to the task of joint clitic-segmentation and syntactic -parsing in Hebrew (Goldberg and Tsarfaty, 2008; Goldberg and Elhadad, 2011) and Arabic (Green and Man- ning, ... attention: Yang and Xue (2010) treat it as classification prob- lem, while Chung and Gildea (2010) pursue several approaches for both Korean and Chinese, and ex- plore applications to machine tr...
Ngày tải lên : 23/03/2014, 16:20
  • 5
  • 335
  • 0
Báo cáo khoa học: "Towards efficient parsing with proof-nets" pdf

Báo cáo khoa học: "Towards efficient parsing with proof-nets" pdf

... which aims at finding an alternating spanning tree in a graph. We do not give the explicit formulation of such an algorithm in this paper: we will only give an idea and an illustration of it. ... translated into a connection graph %(d). axiom: a > a is translated into: -a -+a or +a a rules: [L/q: if x > A translates into 13 and y B z > C translates into y, y B/A x z...
Ngày tải lên : 24/03/2014, 05:21
  • 8
  • 219
  • 0
Báo cáo khoa học: "Hierarchical A∗ Parsing with Bridge Outside Scores" pdf

Báo cáo khoa học: "Hierarchical A∗ Parsing with Bridge Outside Scores" pdf

... heuristic in stan- dard A ∗ parsing (Klein and Manning, 2003). Outside scores are computed by the OUT-L and OUT-R deduction rules. These rules combine an outside item over a large span and inside ... the left and coarse inside item on the right. 2.5 Guarantees These deduction rules come with guarantees anal- ogous to those of HA ∗ . The monotonicity guaran- tee ensures that inside and (...
Ngày tải lên : 30/03/2014, 21:20
  • 5
  • 188
  • 0
Báo cáo khoa học: "Extracting Word Sets with Non-Taxonomical Relation" potx

Báo cáo khoa học: "Extracting Word Sets with Non-Taxonomical Relation" potx

... relations and thematic relations. Both relations identify related words useful to language under- standing and generation, information re- trieval, and so on. However, although words with taxonomical ... useful linguistic resources for language understanding and generation, infor- mation retrieval, and so on. In previous research on natural language processing, many methodologies for...
Ngày tải lên : 17/03/2014, 04:20
  • 4
  • 288
  • 0
Báo cáo khoa học: "Learning Translation Consensus with Structured Label Propagation" potx

Báo cáo khoa học: "Learning Translation Consensus with Structured Label Propagation" potx

... (G-Re- Rank-LC and G-Decode-LC) improve the performance slightly. The combination of graph- based and local consensus features can improve the translation performance significantly on SMT re-ranking. ... sentences/spans which are similar with , and      refers to translation candidates of   .    ,  is initialized with the translation posterior of   given   .The...
Ngày tải lên : 23/03/2014, 14:20
  • 9
  • 312
  • 0

Xem thêm

Từ khóa: