Báo cáo khoa học: "Dynamic Programming for Linear-Time Incremental Parsing" pptx

... Association for Computational Linguistics, pages 1077–1086, Uppsala, Sweden, 11-16 July 2010. c 2010 Association for Computational Linguistics Dynamic Programming for Linear-Time Incremental ... Dynamic programming turns out to be a great fit for early updating (see Section 4.3 for details). 3 Dynamic Programming (DP) 3.1 Merging Equivalent States The key observation for...

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

... dynamic programming algorithms for Probabilistic Context-Free Grammars (PCFGs); specifically the Viterbi algorithm for finding the most probable parse of a string, and the Inside- Outside algorithm for ... of the variables X. There are dynamic programming algorithms for calculating all of these quantities, but for reasons of space we only describe an algorithm for finding the max...

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

... map- ping. Therefore, we obtained new results for these methods in our setup. For the Transfer baseline, for each target language we trained the model on all other languages in our dataset. For the Mixture baseline, ... im- pact the final performance. As a selection criterion for initialization, we consider the performance of the final model averaged over the supervised source lan- gu...

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

... interface for Information Retrieval. Proceedings of the 6th Annual International ACM SIGIR Conference, ACM Special Interest Group on Information Retrieval and American Society for Infor- mation ... word gets transmitted and no pattern for it exists in a base IRule for the head word, higher IRules are searched for the pattern. If a pattern does exist for the modifier in a gi...

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

... MLE using formula (12) 7 return q ∗ Figure 3: Brute-force estimation of q ∗ . Dynamic -Programming- MLE(HG(x )) 1 run inside-outside on the hypergraph HG(x) 2 for v in HG(x) ✄ each node 3 for e ∈ ... q ∗ (· | h) constrained to be a normalized distribution for each h. 596 Brute-Force-MLE(HG(x )) 1 for y, d in HG(x) ✄ each derivation 2 for w in y ✄ each n-gram type 3 ✄ accumulate soft...

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

... improve performance. However, for grammar formalisms which use more fine-grained grammatical cate- gories, for example TAG and CCG, tagging accuracy is much lower. In fact, for these formalisms, ... standard description of the forward- backward algorithm, for example Manning and Schutze (1999), is usually given for an HMM-style tagger. However, it is straightforward to adapt the algo...

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

... word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the op- timal layout of a single tree as well as a numerical method for optimizing ... case need be considered, and the optimal layout for the entire sentence can be computed from the bottom up using just one dy- namic programming state for each node in the tre...

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

... appointment scheduling domain is there- fore ideal for a case study aimed at extracting linguistic indicators for definiteness. 3.1 Overview Explicit marking for definiteness takes place on several ... target language. For this paper, we propose a rule hierarchy for this purpose, that can be used as a pre- processing tool to context checking. All noun phrases marked for de...

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

... for each tar- get relation, an integrated model to weight the dif- ferent extraction options, including for example the likely lengths for events, or the fact that start times should come before ... features. In addition, we enforce label consistency and semantic coherence at record level. Other related works perform structured relation discovery for different settings of information...

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

... Tie-Yan Liu, Jun Xu, and Hang Li. 2010. Letor: A benchmark collection for research on learning to rank for information retrieval. Information Retrieval, 13(4):346–374. S. Shalev-Shwartz, Y. Singer, ... both query and document in- formation, a probabilistic weighting for ⟨x i , x j ⟩ was modeled by w q ∗ w ij . Through the transformation, instance weighting schemes for classification ca...

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