Báo cáo khoa học: "Learning to predict pitch accents and prosodic boundaries in Dutch" ppt

... random sam- pling to sum over equivalent derivations during de- coding, and the latter uses dynamic programming human automatic string -to- string 198,445 142,820 max nested 78,361 64,578 tree -to- string ... sen- tences. Venugopal et al. (2009), in the string -to- tree set- ting, attempt to soften the data-fragmentation ef- fect of the matching constraint: instead of trying to find...

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

... Minimum error rate training in statis- tical machine translation. In ACL. Karolina Owczarzak, Josef van Genabith, and Andy Way. 2007. Labelled dependencies in machine translation evaluation. In ... necessarily pareto-optimal. Algorithm 1 shows the pseudocode. In line 3, we take a point h ∗ and check if it is dominating or dominated in the for- loop (lines 4-8). At least one pa...

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

... while requiring minimal human intervention to prepare the training data. 3 Method To find translations for a given term on the Web, a promising approach is automatically learning to extract ... for each tokens in the same way as done in the training phase. We then use the trained model to tag the snippets, and extract translation candidates by identifying consecutive Chine...

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

... set- ting it is situated in, motivating automated learn- ing approaches to acquiring meaning. Tradi- tional accounts of learning typically rely on lin- guistic annotation (Zettlemoyer and Collins, ... terms such as above and below tend to be interpreted as going to the north and south of landmarks, respectively. Interestingly, our sys- tem tends to move in the opposite cardin...

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

... similar to ours, constisting of: generation of (limited) exploratory dialogue data, using a train- ing system; creating an MDP from these data and the rewards assigned by the training users; off-line policy ... selection in dialogue management (see e.g. Levin et al., 2000; Walker, 2000; Scheffler and Young, 2002; Peek and Chickering, 2005; Frampton and Lemon, 2006), for selecting i...

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

... subdivided into columns and rows. 1 The extracted document fragments appear in a slightly edited form in this paper due to space constraint. 443 Line Line Line Line Line Line Line Line Line ... kinds of characters and their rela- tive locations in a line and across lines to recognize tables. It is domain independent and does not rely on any domain-specific kn...

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

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

... improves and vice 270 versa, in a cycle of continual improvement (Sutton and Barto, 1998). In many games, it is sufficient to maintain a dis- tinct action-value for each unique state and action in a ... the lines: Learning to map high-level instructions to commands. In Proceedings of ACL, pages 1268–1277. S.R.K. Branavan, David Silver, and Regina Barzilay. 2011. Non-linea...

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

... (Pulman and Sukkarieh, 2005) compares several machine learning techniques, including in- ductive logic programming, decision tree learning, and Bayesian learning, to the earlier pattern match- ing ... im- proving upon existing bag-of-words (BOW) ap- proaches to short answer grading by utilizing ma- chine learning techniques. Furthermore, in an at- tempt to mirror the ability of...

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

... all definitions in our data to be used for the learning. 4.3 Training Ranking Models Using the reference ranking data, we trained a rank- ing model using the ranking SVM (Joachims, 2002) (with a linear ... 0.13. Finally, taking the means of ranks given to each definition, we merged the indi- vidual rankings to create the reference rankings. An example of a reference ranking is the botto...

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