Tài liệu Báo cáo khoa học: "Online Learning of Approximate Dependency Parsing Algorithms" potx

... Online Learning of Approximate Dependency Parsing Algorithms Ryan McDonald Fernando Pereira Department of Computer and Information Science University of Pennsylvania Philadelphia, ... online learning al- gorithm and a rich feature set, these models pro- vide state -of- the-art performance across multiple languages. However, the parsing algorithms re- quire that the score of...

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

... ex- amples of the previous section. From the point of view of bag -of- word methods, the pairs (T 1 , H 1 ) and (T 1 , H 2 ) have both the same intra-pair simi- larity since the sentences of T 1 and ... rules that describe a non trivial set of entailment cases. The experiments with the data sets of the RTE 2005 challenge show an improvement of 4.4% over the state -of- the-art me...

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

... lower. Table 6 compares the performances of several of the state of the art dependency parsing systems with ours. When comparing with other depen- dency parsing systems it is especially worth notic- ing ... approximation of the labels’ conditional probabilities. The parameter depth is to determine the depth of the search procedure. State encodes the config- uration of the env...

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

... j). 1. The degree of an arc e ∈ E is the number of connected components c in G e such that the root of c is not dominated by the head of e. 2. The degree of G is the maximum degree of any arc e ∈ ... dominated by the com- putation of model predictions or scores for such arcs. The parsing experiments are performed with a variant of Covington’s algorithm for dependency pars...

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

... spe- cific types of part-whole relations (member -of, sub-quantity -of, contained-in, structural part -of and located-in), and for the general set composed of all types. 4.1 Precision of Extracted Relations Two ... extraction (IE) harder when learning the individual types of part-whole relations? That is, we determine whether the performance of state -of- the-art IE systems in l...

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

... specific and tangible features. Also, there are somewhat a fixed set of features of a specific type of product, for exam- ple, ease of use, durability, battery life, photo quality, and shutter lag ... examples of sen- tences that our system identified as reasons of complaints. (1) Unfortunately, I find that I am no longer comfortable in your establishment because of the...

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

... score of an action. In other words, the score of an hypothesis is the sum of the score of the most recent action h.A and the scores of the top hypotheses of the context states. The score of an ... novel learning framework lies be- tween supervised learning and reinforcement learn- ing. Guided learning is more difficult than super- vised learning, because we do not know the...

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

... in this paper was twofold. Firstly, we wanted to compare the performance of different machine learning algorithms on the task of map- ping from a vector of web frequencies of para- phrases containing ... Over the set of 5 semantic rela- tions defined by Nastase and Szpakowicz (2003), they achieve an accuracy of 45.7% for the task of assigning one of 5 semantic relations...

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

... of parent node in dependency tree. c-word: word of child node. p-pos: POS of parent node. c-pos: POS of child node. p-pos+1: POS to the right of parent in sentence. p-pos-1: POS to the left of ... parent of x j . T = {(x t , y t )} T t=1 denotes the training data. We follow the edge based factorization method of Eisner (1996) and define the score of a dependency tree as t...

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

... Cardie and Wagstaff (1999), Bean and Riloff (2004)). Of course, we can also expand our pre-selected set of corefer- ence systems via incorporating additional learning algorithms, clustering algorithms, ... First, de- sign decisions such as the choice of the learning al- gorithm and the clustering procedure are apparently critical to system performance, but are often made in an ad-ho...

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