sparsity in dependency grammar induction
Báo cáo khoa học: "Sparsity in Dependency Grammar Induction" doc
Ngày tải lên :
07/03/2014, 22:20
... Building a lin-
guistically interpreted corpus of bulgarian: the bul-
treebank. In Proc. LREC.
N. Smith and J. Eisner. 2006. Annealing structural
bias in multilingual weighted grammar induction. In
Proc. ... logistic
normal distribution for grammar induction. In Proc.
NAACL.
S.B. Cohen, K. Gimpel, and N.A. Smith. 2008. Lo-
gistic normal priors for unsupervised probabilistic
grammar induction. In Proc. NIPS.
A.P. ... Learning Approaches
In our experiments, we compare PR learning
to standard expectation maximization (EM) and
to Bayesian learning with a sparsity- inducing
prior. The EM algorithm optimizes marginal...
- 6
- 241
- 0
Tài liệu Báo cáo khoa học: "Dependency Grammar Induction via Bitext Projection Constraints" doc
Ngày tải lên :
20/02/2014, 07:20
... Annealing structural
bias in multilingual weighted grammar induction. In
Proc. ACL.
J. Tiedemann. 2007. Building a multilingual parallel
subtitle corpus. In Proc. CLIN.
K. Toutanova, D. Klein, ... and F. Pereira. 2005. On-
line large-margin training of dependency parsers. In
Proc. ACL, pages 91–98.
I. Mel’
ˇ
cuk. 1988. Dependency syntax: theory and
practice. SUNY. inci.
P. Merlo, S. Stevenson, ... Wicentowski. 2001.
Inducing multilingual text analysis tools via robust
projection across aligned corpora. In Proc. HLT.
377
framework for transferring dependency grammars
via bitext using the posterior...
- 9
- 252
- 0
Tài liệu Báo cáo khoa học: "Word Order in German: A Formal Dependency Grammar Using a Topological Hierarchy" pptx
Ngày tải lên :
20/02/2014, 18:20
... { V, AV, EV, Vfin, Vinf, Vbse, Vpp, …, C,
N, X, Y }
(V = verb, AV = auxiliary verb, EV = verb
with Ersatzinfinitiv, Vfin = finite verb, Vinf
= infinitive with zu, Vbse = base infinitive,
Vpp = ... or by a verb cre-
ating an embedded domain.
3 Formalization
A grammar in the formalism we introduce in
the following will be called a Topological
Dependency Grammar.
Fig. 5. Dependency and phrase
structure ... can.
Positioning of a non-verbal element in a ma-
jor field:
8
(r, V, X, f, ed)
Box creation rules
Creation of the main domain in the initial
field: (Vfin, i, md, [)
Creation of an embedded domain in...
- 8
- 575
- 0
The application of games in teaching grammar with reference to tieng anh 10 textbook at ha trung high school, thanh hoa province
Ngày tải lên :
07/11/2012, 14:44
... motivation in teaching and learning grammar.
- to prove the application of grammar games brings many practical benefits in teaching
and learning grammar in particular, and English in general.
- ... Recommendations
In order to achieve effective results in teaching and learning English in general, English
grammar in particular and make easy the process of using games in teaching grammar, it ... teaching grammar
There is an interesting movement towards teaching grammar with games. It creates
students’ motivation in learning English, especially English grammar. Just imagine when
coming...
- 39
- 1.6K
- 8
Writing In English - Grammar
Ngày tải lên :
25/10/2013, 20:20
... in This does not always have a negative meaning – often it gives the idea of
inside or into,e.g.
internal, insert, income
.
Verb prefixes:
un-
and
dis
These prefixes have two meanings. ... order to convey my points clearly to the
reader?
66
Grammar
Six excellent career fields within mechanical engineering technology are heating, ventilating, and air
conditioning (HVAC); mechanical ... their English equivalents.
abbreviation Latin words in full meaning
AD
anno Domini
since the birth of Christ
a.m.
ante meridiem
in the morning
BC
before Christ
c.
or
ca. circa...
- 21
- 683
- 0
Tài liệu Báo cáo khoa học: "A Gibbs Sampler for Phrasal Synchronous Grammar Induction" docx
Ngày tải lên :
20/02/2014, 07:20
... Start-
ing with a root non-terminal (z
1
), rewrite each
frontier non-terminal (z
i
) using a rule chosen from
our grammar expanding z
i
. Repeat until there are
no remaining frontier non-terminals. ... any
possible re-ordering is also a valid outcome, as
is removing the terminal boundary to form a sin-
gle phrase pair. Otherwise, if the visited boundary
point falls within an existing terminal, then all ... |
3
|e|
3
))
that inference is impractical for real translation
data. Proposed solutions to this problem include
imposing sentence length limits, using small train-
ing corpora and constraining the search...
- 9
- 474
- 1
Tài liệu Báo cáo khoa học: "Hidden Markov Tree Model in Dependency-based Machine Translation∗" pptx
Ngày tải lên :
20/02/2014, 09:20
... Multilinguality in ETAP-3: Reuse of Lexi-
cal Resources. In Proceedings of Workshop Multi-
lingual Linguistic Resources, COLING, pages 7–14.
Ond
ˇ
rej Bojar. 2008. Exploiting Linguistic Data in ... unexploited in
the field of Computational Linguistics, in
spite of highly successful Hidden Markov
(Chain) Models. In dependency trees,
the independence assumptions made by
HMTM correspond to the intuition ... to intuition behind de-
pendency relations (in the linguistic sense) in de-
pendency trees. Moreover, analogously to applica-
tions of HMM on sequence labeling, HMTM can
be used for labeling...
- 4
- 359
- 0
Tài liệu Báo cáo khoa học: "Limitations of Current Grammar Induction Algorithms" pptx
Ngày tải lên :
20/02/2014, 12:20
... improvement.
2 Current Grammar Induction Models
2.1 Algorithms
Grammar induction models can be split up into two
types: tag-based and word-based grammar induc-
tion. The key feature that distinguishes between
these ... incremental
grammar induction algorithms instead of the
approaches of the systems discussed before.
1 Introduction
Grammar induction is a task within the field of nat-
ural language processing that ... practice as a source of insight into
universal grammar. Computational Linguistics, 43:1–
34.
Andrei Mikheev. 1997. Automatic rule induction for
unknown-word guessing. Computational Linguistics,
23(3):405–423.
Andrew...
- 6
- 399
- 0
Tài liệu Báo cáo khoa học: "Pseudo-Projectivity: A Polynomially Parsable Non-Projective Dependency Grammar" docx
Ngày tải lên :
20/02/2014, 18:20
... ordered dependency trees,
containing the non-projective linguistic struc-
tures.
In order to define pseudo-projectivity, we in-
troduce an operation on dependency trees called
lifting. When ...
it matches the beginning of an LP rule), but
that nodes corresponding to the lifting rules in
LM
are being lifted from the subtrees span-
ning
wi wj.
Put differently, in this bottom-
up ... dependent of 77 introduced by
an 1-rule, the dependent must be compati-
ble with an instance of a lifting condition in
LM
(whose dot must be at its beginning, or
seperated from the beginning by optional...
- 7
- 348
- 0
Tài liệu Báo cáo khoa học: "Supervised Grammar Induction using Training Data with Limited Constituent Information *" docx
Ngày tải lên :
20/02/2014, 19:20
... training process more
efficient than a traditional PCFG while main-
taining comparable parsing qualities.
Two training strategies are considered: di-
rect induction, in which a grammar is induced ... on
Grammar
Induction
• Grammar induction is the process of inferring
the structure of a language by learning from ex-
ample sentences drawn from the language. The
degree of difficulty in ...
Numb4r of brackets in me WSJ uaining data number of brackets in the WSJ training data
(a) (b)
Figure 2: Parsing accuracies of (a) directly induced grammars and (b) adapted grammars as a
function...
- 7
- 423
- 0
Tài liệu Báo cáo khoa học: "TYPE-RAISING AND DIRECTIONALITY IN COMBINATORY GRAMMAR*" pdf
Ngày tải lên :
20/02/2014, 21:20
... constrained for English.) One very general
constraint, excluding all combinations with or into
NP,
is included in the program, in order to force
type-raising and exemplify the way in which ... string positions, s Next the combinatory
rule (19) applies, to unify the argument term of the
function with the real argument, binding the remain-
ing positional variables including the distinguished ... claimed elsewhere to constrain the combinatory
rules of composition and type raising in such a way as to
make certain linguistic universals concerning word order
under coordination follow immediately....
- 8
- 386
- 0
Báo cáo khoa học: "Bayesian Synchronous Tree-Substitution Grammar Induction and its Application to Sentence Compression" pdf
Ngày tải lên :
07/03/2014, 22:20
... Computational Linguistics.
Dan Klein and Christopher D. Manning. 2003. Fast
exact inference with a factored model for natural
language parsing. In Advances in Neural Informa-
tion Processing Systems ... improvements
against a number of baselines, including
expectation maximization and variational
Bayes training, illustrating the merits of
nonparametric inference over the space of
grammars as opposed ... (Eisner, 2003) or tree-
adjoining grammars may better capture the pair-
ings.
In this work, we explore techniques for inducing
synchronous tree-substitution grammars (STSG)
using as a testbed application...
- 11
- 424
- 0
Báo cáo khoa học: "Automatic Detection and Correction of Errors in Dependency Treebanks" potx
Ngày tải lên :
07/03/2014, 22:20
... training, with both parsers. The idea
behind this step is that we basically try to repro-
duce the gold standard, since parsing the data seen
during the training is very easy (a similar idea in ... annotations, e.g. labels,
POS tags etc. In fact, in the area of POS tagging a
similar strategy of using the same data for training
and testing in order to detect inconsistencies has
proven to be ... publications concerning
finding errors in phrase structures [5] as well as in
dependency treebanks [6]. The approach is based
on the concept of “variation detection”, first intro-
duced in [7]. Additionally,...
- 5
- 376
- 0
Báo cáo khoa học: "Variational Inference for Grammar Induction with Prior Knowledge" pdf
Ngày tải lên :
08/03/2014, 01:20
... transitions in clustering. Physical Re-
view Letters, 65(8):945–948.
N. A. Smith and J. Eisner. 2006. Annealing structural bias
in multilingual weighted grammar induction. In Proc. of
COLING-ACL.
N. ... grammar
induction. In Advances in NIPS.
J. V. Grac¸a, K. Ganchev, and B. Taskar. 2007. Expectation
maximization and posterior constraints. In Advances in
NIPS.
D. Klein and C. D. Manning. 2004. Corpus-based induction
of ... requiring it to be a
mixture, can help inject prior knowledge
to exploit soft constraints during the varia-
tional E-step.
1 Introduction
Learning natural language in an unsupervised way
commonly involves...
- 4
- 339
- 0