Báo cáo khoa học: "Parsing Non-Recursive Context-Free Grammars" doc
Báo cáo khoa học: "Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank" ppt
... present a theoretical analysis showing an
worst-case time bound for exhaustively parsing arbi-
trary context-free grammars. In what follows, we do
not make use of the probabilistic aspects of the gram-
mar ... tree in which, aside from at most
8
The set of phrasal categories used in the Penn Tree-
bank is documented in Manning and Sch¨utze (1999, 413);
Marcus et al. (1993, 281) has an early...
Tài liệu Báo cáo khoa học: "Parsing Algorithms and Metrics" doc
... can be used for finding these
parses. Some of the most common involve induc-
ing Probabilistic Context-Free Grammars (PCFGs),
and then parsing with an algorithm such as the La-
belled Tree
Báo cáo khoa học: "Parsing Parallel Grammatical Representations" docx
... mechanism.
This paper will examine the model of one of
these theories, Autolexical Grammar (Sadock,
1991; Sadock, 1996; Schiller et al., 1996), as it
is implemented in a computational scope gen- ... by constraint-based, multistratal theo-
ries of grammar (Grimshaw, 1997; Jackendoff,
1997; Sadock, 1991; Van Valin, 1993). In these
models, it is possible to posit multiple represen-
tatio...
Tài liệu Báo cáo khoa học: "Towards History-based Grammars: Using Richer Models for Probabilistic Parsing*" docx
...
coverage, feature-based unification grammar. The
grammar is context-free but uses unification to ex-
press rule templates for the the context-free pro-
ductions. For example, the rule template: ...
rewrite the joint probability in (1) as:
~r~
p(T,
w~) = H p(r, ]t[)
i=1
In a probabilistic context-free grammar (P-CFG),
the probability of an expansion at node i depends
only on...
Báo cáo khoa học: "Parsing preferences with Lexicalized Tree Adjoining Grammars : exploiting the derivation tree" pptx
... descendants of
X then become the descendants of the foot node
of the auxiliary tree. Contrary to context-free
rewriting rules, the history of derivation must be
made explicit since the same derived
Báo cáo khoa học: "Parsing Non-Recursive Context-Free Grammars" doc
... Padova, Italy
satta@dei.unipd.it
Abstract
We consider the problem of parsing
non-recursive context-free grammars, i.e.,
context-free grammars that generate finite
languages. In natural language process-
ing, ... finite set is typically encoded in a
compact way as a context-free grammar (CFG) that
is non-recursive. This is motivated by the fact that
non-recursive CFGs allow very compa...
Tài liệu Báo cáo khoa học: "Parsing with generative models of predicate-argument structure" pptx
... dependencies of Dutch are one
of the syntactic constructions that led people to
believe that more than context-free power is re-
quired for natural language analysis. Here is an
example together with
Tài liệu Báo cáo khoa học: "Parsing, Projecting & Prototypes: Repurposing Linguistic Data on the Web" doc
... tag
set,
3
use the learner to tag new documents, and con-
vert the best tag sequence into a span sequence. When
trained on 41 documents (with 1573 IGT instances) and
tested on 10 documents (with 447 instances), ... list all the documents
that have data for the language in question. The user
can then click on any of those documents, and search
tool will return the IGT instances found in those...
Từ khóa: