training of dependency parsers
Tài liệu Báo cáo khoa học: "Online Large-Margin Training of Dependency Parsers" docx
Ngày tải lên :
20/02/2014, 15: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 the sum of the score of ... for training
dependency parsers. We use simple linear parsing
models trained with margin-sensitive online training
algorithms, achieving state -of- the-art performance
with relatively modest training...
- 8
- 443
- 0
Tài liệu Báo cáo khoa học: "Semi-supervised Learning of Dependency Parsers using Generalized Expectation Criteria" ppt
Ngày tải lên :
20/02/2014, 07:20
... complex-
ity of non-projective data-driven dependency parsing. In
Proc. of IWPT, pages 121–132.
Ryan McDonald, Koby Crammer, and Fernando Pereira.
2005. Online large-margin training of dependency
parsers. ... marginal
probability of a particular edge k → i (i.e. y
i
=k),
the score of any edge k
→ i such that k
= k is
set to 0. The determinant of the resulting modi-
fied Kirchoff matrix K
k→i
is then the sum of ... x.
By relating the sum of the scores of all possible
trees to counting the number of spanning trees in a
graph, it can be shown that Z
x
is the determinant
of the Kirchoff matrix K, which is...
- 9
- 403
- 1
Báo cáo khoa học: "Data point selection for cross-language adaptation of dependency parsers" pot
Ngày tải lên :
17/03/2014, 00:20
... induction of syntactic structure: models of de-
pendency and constituency. In ACL.
Ryan McDonald, Koby Crammer, and Fernando Pereira.
2005. Online large-margin training of dependency
parsers. ... adaptation of dependency parsers.
3 Experiments
3.1 Data point selection
The key idea in our experiments is that we can use a
simple form of instance weighting, similar to what is
often used ... Data-driven de-
pendency parsing of new languages using incomplete
and noisy training data. In CoNLL.
Kathrin Spreyer, Lilja Øvrelid, and Jonas Kuhn. 2010.
Training parsers on partial trees: a cross-language
comparison....
- 5
- 309
- 0
Statistical training of researchers in total quality management: The japanese experience
Ngày tải lên :
26/10/2012, 09:41
... been composed of one professor, one associate
professor and two research associates.
To give an example, at the University of Tokyo about 15 professors and associate
professors of statistics ... researcher to be aware of the stage he or she is in the stream of
R & D. This implies the necessity of an in-company training course at least in the final
stage of education of applied statistics, ... manager
to supervise the whole process of R & D.
Now under the circumstances of Japan and the characteristics of applied statistics,
the need of some extensive training system for people to perform...
- 12
- 714
- 0
Tài liệu Báo cáo khoa học: "Inducing Gazetteers for Named Entity Recognition by Large-scale Clustering of Dependency Relations" ppt
Ngày tải lên :
20/02/2014, 09:20
... terms of execution speed, may
4
Acknowledgements: This corpus was provided by Dr.
Daisuke Kawahara of NICT.
5
To be precise, we need two copies of these.
6
Each node has a copy of the training ... also
characterize the dependent MNs well.
Given L training examples of verb-MN depen-
dencies {(vt
i
, n
i
, f
i
)}
L
i=1
, where f
i
is the number
of dependency (vt
i
, n
i
) in a corpus, the EM-based
clustering ... semantics of MNs
well, the MN clusters constructed by using
dependency relations should serve as a good
gazetteer. However, the high level of computa-
tional cost has prevented the use of clustering
for...
- 9
- 428
- 0
Tài liệu Báo cáo khoa học: "Event Matching Using the Transitive Closure of Dependency Relations" pdf
Ngày tải lên :
20/02/2014, 09:20
... “resigns” is root of event.
Figure 2: Types of dependency features. Example features are for e = ”Abdul Halim Khaddam resigns as Vice
President of Syria” and s = ”The resignation of Khaddam was ... how much of the basic information of an event
e is present in a sentence s.
2.1 Lexical features
We employ several types of simple lexical-matching
features. These are similar to the “bag -of-
words” ... features obtained from the tran-
sitive closure of dependency relations. The
method yields a model capable of matching
events with an F-measure of 66.5%.
1 Introduction
Question answering systems...
- 4
- 392
- 0
Gentle Measures in the Management and Training of the Young docx
Ngày tải lên :
06/03/2014, 20:20
... MODES OF MANAGEMENT.
It is not impossible that in the minds of some persons the idea of employing gentle measures in the
management and training of children may seem to imply the abandonment of ... this.
It is very plain that softening thus the hardship for the child of any act of obedience required of him by giving
him a little time implies no abatement of the authority of the parent, nor does ... followed up by the watchful efficiency of the mother. We can not substitute
the action of the child for that of the parent in the work of early training, but we can often derive very great
advantage...
- 139
- 442
- 0
Báo cáo khoa học: "Efficient Third-order Dependency Parsers" pdf
Ngày tải lên :
07/03/2014, 22:20
... Depen-
dency Parsing. In Proceedings of IWPT.
10
Ryan McDonald, Koby Crammer, and Fernando
Pereira. 2005a. Online Large-Margin Training of
Dependency Parsers. In Proceedings of the 43
rd
ACL, pages 91–98. ... computational cost of the parsing algorithm.
Consequently, recent work in dependency pars-
ing has been restricted to applications of second-
order parsers, the most powerful of which (Car-
reras, ... example dependency structure.
selection of the sentential head to be modeled as if
it were a dependency.
For a sentence x, we define dependency parsing
as a search for the highest-scoring analysis of...
- 11
- 322
- 0
Báo cáo khoa học: "Simple semi-supervised training of part-of-speech taggers" pptx
Ngày tải lên :
07/03/2014, 22:20
... with little
labeled training data but negative results when
the amount of labeled training data increased; the
same seems to be the case in Wang et al. (2007)
who use co -training of two diverse POS ... supervised baseline. Spoustova
et al. (2009) use a new pool of unlabeled data
tagged by an ensemble of state -of- the-art taggers
in every training step of an averaged perceptron
POS tagger with 4–5% error ... knowledge of supervised learn-
ing algorithms. Most of our experiments are im-
plementations of wrapper methods that call off-
1
The numbers provided by Unsupos refer to clusters; ”*”
marks out -of- vocabulary...
- 4
- 269
- 0
Báo cáo khoa học: "Task-oriented Evaluation of Syntactic Parsers and Their Representations" potx
Ngày tải lên :
08/03/2014, 01:20
... the training data for the retraining
of dependency parsers. For the other parsers, we in-
put the concatenation of WSJ and GENIA for the
retraining, while the reranker of RERANK was not re-
trained ... of biomedical paper abstracts. Accu-
racy improvements in this setting indicate the pos-
sibility of domain adaptation, and the portability of
the training methods of the parsers. Since the parsers
listed ... domain of our target text is different from
WSJ, our experiments also highlight the domain
portability of parsers. We run two versions of each
parser in order to investigate the two types of domain
portability....
- 9
- 483
- 0
Báo cáo khoa học: "Semi-supervised Convex Training for Dependency Parsing" potx
Ngày tải lên :
08/03/2014, 01:20
... McDonald, K. Crammer, and F. Pereira. 2005a. On-
line large-margin training of dependency parsers. In
Proceedings of the Annual Meeting of the Association
for Computational Linguistics.
R. McDonald, ... and C. Manning. 2004. Corpus-based induction
of syntactic structure: Models of dependency and con-
stituency. In Proceedingsof the Annual Meeting of the
Association for Computational Linguistics.
G. ... regularization. In Pro-
ceedings of The Conference on Computational Natural
Language Learning, pages 21–28.
Q. Wang, D. Lin, and D. Schuurmans. 2007. Simple
training of dependency parsers via structured...
- 9
- 304
- 0
Báo cáo khoa học: "Integrating Graph-Based and Transition-Based Dependency Parsers" docx
Ngày tải lên :
08/03/2014, 01:20
... undoubtedly one of the reasons
for the emergence of dependency parsers for a wide
range of languages. Many of these parsers are based
on data-driven parsing models, which learn to pro-
duce dependency ... Online large-margin training of dependency
parsers. In Proceedings of ACL, pages 91–98.
Ryan McDonald, Fernando Pereira, Kiril Ribarov, and
Jan Haji
ˇ
c. 2005b. Non-projective dependency pars-
ing ... sense of letting a
subset of the features for one model be derived from
the output of a different model has been exploited
for dependency parsing by McDonald (2006), who
trained an instance of MSTParser...
- 9
- 241
- 0
Báo cáo khoa học: "Exploring Correlation of Dependency Relation Paths for Answer Extraction" doc
Ngày tải lên :
08/03/2014, 02:21
... relation
correlations from a set of training path pairs. The
training data collecting will be described in Sec-
tion 6.1.
For each question and its answer sentences in
training data, we extract relation ... paths
of each pair is calculated by employing Dynamic
Time Warping algorithm. The input of the cal-
culation is correlations between dependency re-
lations, which are estimated from a set of train-
ing ... correlations, ME model may es-
timate the optimal weights of the paths based on
a training data set. (Berger et al., 1996) gave a
good description of ME model. The model we
use is similar to (Shen et...
- 8
- 350
- 0
Báo cáo khoa học: "Scalable Inference and Training of Context-Rich Syntactic Translation Models" pptx
Ngày tải lên :
17/03/2014, 04:20
... com-
plement span of any node n to each of its children,
and for each of them, add the span of the child
to the complement span of all other children. In
another traversal of G, we determine ... building algorithm.
963
lhs
1
: NP-C(x
0
:NPB PP(IN (of) x
1
:NP-C)) (NP -of- NP)
lhs
2
: PP(IN (of) NP-C(x
0
:NPB PP(IN (of) NP-C(x
1
:NPB x
2
:VP)))) (of- NP -of- NP-VP)
lhs
3
: VP(VBD(said) SBAR-C(IN(that) ... possible ways of attaching to constituents
of π: besides the highest attachment (rule (f)),
can move along the ancestors of France, since it is
to the right of the translation of that word, and...
- 8
- 314
- 0
Báo cáo khoa học: "Unsupervised Learning of Dependency Structure for Language Modeling" potx
Ngày tải lên :
17/03/2014, 06:20
... Examples of dependency structure. (a) A
dependency structure of an English sentence. Square
brackets indicate base NPs; underlined words are the
headwords. (b) A Japanese equivalent of (a). ... feasible both in
training and decoding. In the next section, we offer
a DLM that satisfies both of these constraints.
3 Dependency Language Model
The DLM attempts to generate the dependency
structure ... dependency structure.
3.1 Dependency parsing
The aim of dependency parsing is to find the most
probable D of a given W by maximizing the prob-
ability P(D|W). Let D be a set of probabilistic de-
pendencies...
- 8
- 380
- 0
