Báo cáo khoa học: "Variational Inference for Grammar Induction with Prior Knowledge" pdf

... in- dicating being a name or not. Without these con- straints, t-table entries for names with low frequency tend to be flat and word alignments can be chosen randomly without sufficient statistics or ... translation performance by the BLEU score (Papineni et al., 2002) and Translation Error Rate (TER) (Snover et al., 2006) with one ref- erence for each hypothesis. Word alignment mod- el...

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

... Meeting of the Association for Computational Linguistics, pages 239–247, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics Bayesian Inference for Zodiac and Other ... Knight University of Southern California Information Sciences Institute Marina del Rey, California 90292 {sravi,knight}@isi.edu Abstract We introduce a novel Bayesian approach for de...

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

... I argue for the development of entirely incremental grammar induction algorithms instead of the approaches of the systems discussed before. 1 Introduction Grammar induction is a task within the ... this is true, isn’t the grammar induction pursuit deemed to fail? Not really. First, there are hints that children do receive negative information, and that they use it for grammar...

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

... performance end end average_performance and keep average_performance end B = best average_performance bestFeatures  B ∪ bestFeatures end Figure 2. Implemented algorithm for forward ... saved for later experiments. 4.1 Selecting the features The first task was to reduce the dimensionality and find the best set of features for maximizing the PPV for Emotional cla...

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

... compare to learning with several Bayesian priors that have been applied to the DMV. One such prior is the Dirichlet, whose hyperparameter we will denote by α. For α < 0.5, this prior encourages ... sentences increases. For the bot- tom two entries in the table, which are for the E- DMV, the last entry is best, corresponding to us- ing a DD prior with α = 1 (non-sparsifying)...

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

... in collaboration with human translators within a computer-assisted translation (CAT) or interactive framework (Isabelle and Church, 1997). Interactivity in CAT has been explored for a long time. ... seek for the target string e which maximizes the posterior probability: ˆ e = argmax e P r(e|f ) (1) Within the IMT framework, a state-of-the-art SMT system is employed in the following way....

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

... O(n 4) results for the natural formalism of bilexical context-free grammar, and for AI- shawi's (1996) head automaton grammars. For the usual case, split head automaton grammars or equivalent ... after all: • For bilexicalized context-free grammars, O(n 4) is possible. • The O(n 4) result also holds for head au- tomaton grammars. • For a very common special case of...

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

... the grammar formalism ; a discussion on the linguistic approach can be found in [Vauquois 78] and [Zaharin 87]. For this grammar formalism, a structural representation is given in the form ... structural representations. The grammar formalism for such a purpose is called the String-Tree Correspondence Grammar (STCG). The STCG is a more formal version of the Static Grammar...

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

... F1 for NER and 82.6% Accuracy for NEN, outperforming the baseline with 80.2%F1 for NER and 79.4% Accuracy for NEN. We summarize our contributions as follows. 1. We introduce the task of NEN for ... connected with a “1” label. Note that there are no NEN labels for pairs like “her 1 1 ” and “her 1 2 ” or with 1 1 and with 1 2 ”, since words like “her” and with are stop words....

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

... until the chosen grammar set G min2 does not change. 5 4.2 Minimization with grammar- informed initialization There are two complementary ways to use grammar- informed initialization with the IP- minimization ... 33.0% obtained by starting with uniform transition distributions. We refer to a model learned from basic EM (uni- formly initialized) as EM, and to a model with grammar-...

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