Báo cáo khoa học: "Lexicalized Context-Free Grammars" pot
Báo cáo khoa học: "Lexicalized Context-Free Grammars" pot
... s(;habes@merl.com and dick((~merl.coin
Lexicalized context-free grammar (LCFG) is
an attractive compromise between the parsing ef-
ficiency of context-free grammar (CFC) and the
elegance and ... Lexicalized Context-Free Grammars
Yves Schabes and Richard C. Waters
Mitsubishi Electric Research Laboratories ... with LTAG
the ability to lexicalize CF(I;s without changing
the trees g...
Báo cáo khoa học: "Extending Lambek grammars: a logical account of minimalist grammars" pot
... rules
(called hypothetical reasoning in the Lambek cal-
culus): so our system looks more like Com-
binatory Categorial Grammars or classical AB-
grammars. Nevertheless some hypotheses can be
cancelled ... move condition if it is
such that:
the same formula never occurs twice as a hy-
pothesis of any sequent
every active hypothesis during the proof pro-
cess is discharged as soon as possible
T...
Báo cáo khoa học: "Factoring Synchronous Grammars By Sorting" potx
... about
recognizing permutations that can be
factored.
1 Introduction
Synchronous Context-Free Grammars (SCFGs)
are a generalization of the Context-Free Gram-
mar (CFG) formalism to simultaneously produce
strings ... Italy
Hao Zhang
Computer Science Dept.
University of Rochester
Rochester, NY 14627
Abstract
Synchronous Context-Free Grammars
(SCFGs) have been successfully exploited
as tran...
Tài liệu Báo cáo khoa học: A knowledge-based potential function predicts the specificity and relative binding energy of RNA-binding proteins ppt
... applications of statistical potentials to pre-
diction of relative binding energies.
The effect of training set composition
on potential function performance
All knowledge-based potentials face the possibility ... complexes.
The statistical potential performs as well as highly
optimized physical potential functions in tests of
docking decoy discrimination. We anticipate that the
performance o...
Tài liệu Báo cáo khoa học: "Using adaptor grammars to identify synergies in the unsupervised acquisition of linguistic structure" docx
... University
Mark
Johnson@Brown.edu
Abstract
Adaptor grammars (Johnson et al., 2007b) are
a non-parametric Bayesian extension of Prob-
abilistic Context-Free Grammars (PCFGs)
which in effect learn the probabilities of en-
tire subtrees. In practice, ... Compu-
tational linguistics can contribute to this debate by
identifying which aspects of language can poten-
tially be learnt from the input...
Tài liệu Báo cáo khoa học: "Generalized Multitext Grammars" pdf
... formalism that is weakly equiv-
alent to Linear Context-Free Rewriting Systems
(LCFRS), but retains much of the notational and in-
tuitive simplicity of Context-Free Grammar (CFG).
GMTG allows both ... power is equivalent to Linear Context-Free
Rewriting Systems (LCFRS), a formalism for de-
scribing a class of MCSGs. The generalization is
achieved by allowing context-free productions...
Tài liệu Báo cáo khoa học: "Coping with Extragrarnmaticality" potx
... expectation-based spelling correcter must be invoked from
within the morphological decomposition routines on potentially
misspelt roots or inflexions.
2.4. Incorrect segmentation
Input typed to a natural ... ATNs [27], the syntactic and semantic parts of the
grammar are kept separate, thus giving the potential for a higher
d~gree of interpretivem:ss in using the semantic information.
H...
Tài liệu Báo cáo khoa học: "Talking About Trees" potx
... computational complexity
of grammatical formalisms.
The second type of shortcoming is more serious
and potentially far more interesting. Two cases
in point are (i) the distinction made in 6PS6 be-
tween
Từ khóa: