Báo cáo khoa học: "Native Language Detection with Tree Substitution Grammars" pptx
Báo cáo khoa học: "Native Language Detection with Tree Substitution Grammars" pptx
... best
result at the task of native language detection.
2 Related Work
2.1 Native Language Detection
Work in automatic native language detection has
been mainly associated with the ICLE, published in
2002. ... the potential of Tree Substitu-
tion Grammars as a source of features for na-
tive language detection, the task of inferring
an author’s native language from text in...
Tài liệu Báo cáo khoa học: "Bayesian Symbol-Refined Tree Substitution Grammars for Syntactic Parsing" pptx
... form
of elementary trees i.e., tree fragments of height
≥ 1. The root and internal nodes of the elemen-
tary trees are labeled with nonterminal symbols, and
leaf nodes are labeled with either terminal ... frontier nonterminals, and form the substitution
sites to be combined with other elementary trees.
A derivation is a process of forming a parse tree.
It starts with a root symb...
Tài liệu Báo cáo khoa học: "Prefix Probabilities from Stochastic Tree Adjoining Grammars*" pptx
... auxiliary trees with
empty yield
case of lexicalized TAGs. However, in the com-
putation of the prefix probability we must take
into account trees with non-empty yield which
behave like trees with ...
trees
and .A is a set of auxiliary trees. Trees in :TU.A
are also called elementary trees.
We refer to the root of an elementary tree t as
Rt.
Each auxiliary tree has exactl...
Tài liệu Báo cáo khoa học: "NATURAL LANGUAGE INTERACTION WITH MACHINES" doc
... are very restricted in
terms of the language used for the interaction with
machines. The problem with unrestricted natural
language for cor-unicacion with machines is chaC no
automatic way ...
transactions
with
machines and textual messages
between
people. Some
viewdata systems use elaborate
tree searches Co reach the desired frame of
information. Some people believe th...
Báo cáo khoa học: "Randomized Language Models via Perfect Hash Functions" pptx
... easily
combined with existing model reduction tech-
niques such as entropy-pruning. We demon-
strate the space-savings of the scheme via ma-
chine translation experiments within a dis-
tributed language ... the
resulting LM can become prohibitive.
With large monolingual corpora available in ma-
jor languages, making use of all the available data
is now a fundamental challenge in langua...
Tài liệu Báo cáo khoa học: "A structure-sharing parser for lexicalized grammars" pptx
... l', r']),
(T', ql, [r", r, -,
-]) •
7Derivation trees axe labelled with tree names and
edges axe labelled with tree addresses.
I, qs E Fk
for some k, (q', A, q) E ~k' ... know what tree it has just
recognised 4. When automata for trees with dif-
ferent root categories are merged, the resulting
automaton needs to somehow indicate to the
parse...
Tài liệu Báo cáo khoa học: "Long-Distance Scrambling and Tree Adjoining Grammars" doc
... adjoin trees from the same set into each other.
Thus, we can interpret TAGs with relaxed dominance
as MC-TAGs, by identifying subtrees containing only
ID relations with trees in an MC-TAG tree ... dif-
ferent trees. When an auxiliary tree fl is adjoined into
an initial tree et, the nodes of fl are not ordered with
respect to the nodes of a. However, even in languages
with...
Tài liệu Báo cáo khoa học: "BIDIRECTIONAL PARSING OF LEXICALIZED TREE ADJOINING GRAMMARS" pdf
... finite sets of trees, called
initial trees
and
auxiliary trees
respectively. The trees in the set
IuA are
called
elementary trees.
We assume that the reader is familiar with the
definitions ...
Lexicalized Tree Adjoining Grammars
(Schabes
et
al.,
1988) are a refinement of TAGs such that each
elementary tree is associated with a lexieal item,
called the
anchor
of the...
Tài liệu Báo cáo khoa học: "Natural Language for Expert Systems: Comparisons with Database Systems" ppt
... Natural Language for Expert Systems:
Comparisons with Database Systems
Kathleen R. McKeown
Department of Computer Science
Columbia University
New York, N.Y. 10027
1
Introduction
Do natural language ... we assume that
explanation will be part of natural language dialog
with the system, allowing the user maximum
flexibility in interacting with the system and allowing
the...
Báo cáo khoa học: "Enhancing Language Models in Statistical Machine Translation with Backward N-grams and Mutual Information Triggers" ppt
... toolkit
that we use to train a forward n-gram language
model to train a backward n-gram language model
without any other changes. To be consistent with
training, we also need to reverse the order ... baseline with the backward language
model. F+B: forward+backward language model .
is better enough to be selected as the best hypothe-
sis by the decoder. This suggests that the backw...
Từ khóa: