Báo cáo khoa học: "Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations" pot
Báo cáo khoa học: "Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations" pot
... Multiset-Valued Linear Index Grammars:
Imposing Dominance Constraints on Derivations
Abstract
This paper defines multiset-valued linear index gram-
mar and unordered vector grammar with dominance ... definition differs from
that of UVG only in that vectors are equipped with
dominance relations which impose an additional condi-
tion on derivations. Note that the de...
Báo cáo khoa học: "ASIMPLIFIED THEORY OF TENSE REPRESENTATIONS AND CONSTRAINTS ON THEIR COMPOSITION" potx
...
E_R S_R
Jon WOn
Jon wins,
is winning
Jon will win
Jon had won
Jon has won
Jon will have won
Table 2: The six STSs expressible in English ver-
bal morphology
detailed in Section 3.) Each ... prefer one over the other. This was exacer-
bated by the fact that he used non-semantic constraints
on adjunction, reducing the amount of constraint that
the acceptability data on adjunc...
Báo cáo khoa học: "A Polynomial-Time Fragment of Dominance Constraints" ppt
... 1: A dominance constraint (from scope underspecification).
2 Dominance Constraints
In this section, we define the syntax and se-
mantics of dominance constraints. The vari-
ant of dominance constraints ... application of normal
dominance constraints is scope underspecifi-
cation: Constraints as in Fig. 1 can serve
as underspecified descriptions of the semantic
readings of sente...
Tài liệu Báo cáo khoa học: "GF Parallel Resource Grammars and Russian" docx
... Inflection Paradigms and Lexicon
Besides word class declarations, morphology
modules also contain functions defining common
inflectional patterns (paradigms) and a lexicon.
This information is language-specific, ... that the
function And is the same as the resource coordina-
tion function ConjS, the function ShePatient
is expressed by the resource pronoun SheNP
and the function BeInCondition is e...
Tài liệu Báo cáo khoa học: "Towards History-based Grammars: Using Richer Models for Probabilistic Parsing*" docx
... order for these predictions is pos-
sible, we only experimented with this one.
Parameter Estimation
We only have built a decision tree to the rule prob-
ability component (3) of the model. ... dominat-
ing constituents. All of these aspects of context
are necessary for disambiguation, yet none is suf-
ficient.
We propose a probabilistic model of context
for disambiguation in parsing,...
Báo cáo khoa học: "Towards Abstract Categorial Grammars" pot
... built upon A
2
;
2. G : C
1
→ Λ(Σ
2
) is a function that interprets
the constants of Σ
1
as linear λ-terms built
upon Σ
2
;
3. the interpretation functions are compatible
with the typing relation, ... In
particular, the exponential ‘!’ allows the intuition-
istic implication ‘→’ to be defined, which cor-
responds to the possibility of dealing with non-
linear λ-terms. A need for such non -...
Báo cáo khoa học: "HANDLING LINEAR PRECEDENCE CONSTRAINTS BY UNIFICATION" pptx
... list of LP -constraints. Consequently the
violation of LP -constraints results in unification
failure. For reasons of space we only present the basic
idea.
The compilation step is based on the ... pro-
jection with which they are combined contains some-
thing that is incompatible with the LP constraints. A
projection contains only information about which
constituents are contained...
Báo cáo khoa học: "Lexicalized Context-Free Grammars" pot
...
There are three situations where combination is
possible: sibling concatenation, left recursive con-
catenation, and right recursive concatenation.
Sibling concatenation is illustrated in Fig- ... by non-
terminal symbols.
(ii) The nodes on the frontier consist of
zero or more non-terminal symbols and
one or more terminal symbols.
(iii) All but one of the non-terminal sym-
bols o...
Báo cáo khoa học: "Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank" ppt
... experiments,
which focus solely on the parser load and grammar structure.
TOP
S-HLN
NP-SBJ
-NONE-
VP
VB
Atone
TOP
S
NP
-NONE-
VP
VB
Atone
TOP
S
VP
VB
Atone
TOP
S
Atone
TOP
VB
Atone
(a) (b) (c) (d) (e)
Figure ... representation and tree transformations,
but little by top-down vs. bottom-up strate-
gies. We discuss grammatical saturation, in-
cluding analysis of the strongly connected
compone...
Báo cáo khoa học: "Efficient Linear Logic Meaning" docx
...
and once each positively and negatively in the
contribution of "gray".
The pattern is that every type atom occurs
once positively in one contribution, once nega-
tively in one contribution, ...
inition identifies exactly one positive and one
negative skeleton occurrence of each type among
all the contributions for a sentence.
4 Efficient deduction of underspecified
represe...
Từ khóa: