Báo cáo khoa học: "Dependency Parsing with Undirected Graphs" ppt

... models used for the undirected parsers were adapted from those of the directed parsers as described in Section 3.1. 4 The results show that the use of undirected parsing with label-based reconstruction ... combinations. As expected, the good results obtained by the undirected parsers with label-based reconstruc- tion contrast with those obtained by the variants with root-based...

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

... would not be possible within Bracket, as patterns check that no other brackets are within their segment of interest. Simply composing the Phase transducer with itself without introducing a ... Only0neUnlinked, with, for instance, M = M .0. Unlinked_l .0. Unlinked_2 .0. Unlinked_3; will have the parser produce outputs with up to 3 unlinked word final IGs, when there are no outputs...

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

... and conclusions. 2 Fast dependency parsing and wide-coverage HPSG parsing 2.1 Data-driven dependency parsing Because we use dependency parsing as a step in deep parsing, it is important that we ... dependency and HPSG parsing approaches in section 2. In section 3, we present our framework for HPSG parsing with shallow dependency constraints, and in section 4 we 624 Figure 1: HP...

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

... 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 ... the rich literature on tree automata. This paper makes the connection concrete with a tree transducer based semantic parsing model and suggests that other models can be interpreted in a simi...

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

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

... dependency parsing with percep- tron. In Proceedings of the CoNLL. Xavier Carreras, Michael Collins, and Terry Koo. 2008. Tag, dynamic programming, and the percep- tron for efficient, feature-rich parsing. ... Huang and David Chiang. 2005. Better k-best parsing. In Proceedings of the IWPT, pages 53–64. Liang Huang. 2008. Forest reranking: Discriminative parsing with non-local feature...

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

... Short Papers, pages 41–44, Suntec, Singapore, 4 August 2009. c 2009 ACL and AFNLP Incremental Parsing with Monotonic Adjoining Operation Yoshihide Kato and Shigeki Matsubara Information Technology ... incremental parsing. 1 Introduction Incremental parser reads a sentence from left to right, and produces partial parse trees which span all words in each initial fragment of the sentence....

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

... bunsetsu. These constraints are usually used for Japanese de- pendency parsing. 3.1 Clause-level Dependency Parsing Dependency parsing within a clause boundary unit, when the sequence of bunsetsus in ... Results The parsing times of both methods are shown in Table 3. The parsing speed of our method im- proves by about 5 times on average in comparison with the conventional method....

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

... framework on the domain of semantic parsing shows ad- vantages in comparison with the original large margin methods. 1 Introduction Natural language semantic parsing is an interest- ing problem ... Bagging for semantic parsing The bagging method (Breiman, 1996) is sim- ply created K bootstrap with sampling m items from the training data of sentences and their logi- cal forms with...

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

... associating each node with one of the three atomic values ass, rec or 0. These values represent the Case properties of the node they are associated with; a node associated with the property ... Case assigner, a node associated with the property rec must be capable of being assigned Case, and a node associated with the property 0 must be neutral with respect to Case. The Cas...

Ngày tải lên: 17/03/2014, 20:20