Báo cáo khoa học: "Unifying Synchronous Tree-Adjoining Grammars and Tree Transducers via Bimorphisms" pptx
Báo cáo khoa học: "Unifying Synchronous Tree-Adjoining Grammars and Tree Transducers via Bimorphisms" pptx
... USA
shieber@deas.harvard.edu
Abstract
We place synchronous tree- adjoining
grammars and tree transducers in the
single overarching framework of bimor-
phisms, continuing the unification of
synchronous grammars and tree transduc-
ers ... Unifying Synchronous Tree- Adjoining Grammars and
Tree Transducers via Bimorphisms
Stuart M. Shieber
Division of Engineerin...
Tài liệu Báo cáo khoa học: "GF Parallel Resource Grammars and Russian" docx
... multilingual
general-purpose grammar projects that GF can
be related to, are LFG grammars (Butt et al.,
1999) and HPSG grammars (Pollard and Sag,
1994), although their parsing-oriented unification-
based formalisms ... code reuse (both within and across languages)
and higher abstraction level for writing application
grammars. According to the ”division of labor”
principle, resourc...
Tài liệu Báo cáo khoa học: Molecular evolution of shark and other vertebrate DNases I pptx
... oligonucle-
otide primers, and the 3¢ -and5 ¢-RACE systems were
obtained from Invitrogen; CM-Sepharose CL-6B, Mono
S 5/50 GL and Superdex 75 were from Amersham
Pharmacia Biotech; the Expanded High Fidelity ... residues at
positions 101 and 104 a re well conserved in v ertebrate
DNases I, these residues were replaced by Ala100 and
Thr103 in H. japonicus DNase I and by Ser101 and Se...
Báo cáo khoa học: "Learning Synchronous Grammars for Semantic Parsing with Lambda Calculus" docx
... successfully put into use in syntax-
based SMT are synchronous context-free gram-
mars (SCFG) (Wu, 1997) and synchronous tree-
substitution grammars (STSG) (Yamada and Knight,
2001). Both formalisms have ... multiple parse trees in a single deriva-
tion, synchronous grammars are ideal for model-
ing syntax-based translation because they describe
not only the hierarchical struc...
Báo cáo khoa học: "Factoring Synchronous Grammars By Sorting" potx
... than Θ(n
2
).
2 Synchronous CFGs and permutation
trees
We begin by describing the synchronous CFG for-
malism, which is more rigorously defined by Aho
and Ullman (1972) and Satta and Peserico (2005).
Let ... We start with left and
right candidate boundaries at the two points imme-
diately to the left and right of the split point, and
then repeatedly check whether the current...
Tài liệu Báo cáo khoa học: "Unifying Parallels" pptx
...
derstanding of both the limitations and the pre-
dictions of the approach. Computationally, it
has both a declarative and a procedural inter-
pretation - this supports both transparency and ... such cases: first,
the interaction of parallelism and sloppy iden-
tity and second, the interaction of parallelism
and focus.
3 Parallelism and Focus
Since (Jackendoff, 1972), it...
Tài liệu Báo cáo khoa học: "Towards History-based Grammars: Using Richer Models for Probabilistic Parsing*" docx
... sentence-
tree pairs, we had about 240,000 tuples and we
grew a tree with about 40,000 nodes. This re-
quired 18 hours on a 25 MIPS RISC-based ma-
chine and the resulting decision tree was ... under-
standing.
Previous work on disambiguation and proba-
bilistic parsing has offered partial answers to this
question. Hidden Markov models of words and
*Thanks to Philip Resni...
Tài liệu Báo cáo khoa học: "An expressive formalism for describing tree-based grammars" docx
... for
standard unification grammars, less attention has
been paid to the issue of developing such environ-
ments for tree based grammars that is, grammars
like Tree Adjoining Grammars (TAG) or Tree ... description and factor-
ization both of trees and of tree descriptions; that
it allows the synchronized description of several
linguistic dimensions (e.g., syntax and semantics)...
Báo cáo khoa học: "Bayesian Synchronous Tree-Substitution Grammar Induction and its Application to Sentence Compression" pdf
... translation, paraphrase, and
sentence compression. The induced tree map-
pings can be expressed by synchronous grammars.
Where the tree pairs are isomorphic, synchronous
context-free grammars (SCFG) may ... experiments with training
algorithms for tree- to -tree synchronous
tree- substitution grammar (STSG) for
monolingual translation tasks such as
sentence compression and...
Báo cáo khoa học: "Towards Abstract Categorial Grammars" pot
... be represented as such a bi-
morphism.
4.3 Tree adjoining grammars
The construction that allows to handle the tree
adjoining grammars of Joshi (Joshi and Schabes,
1997) may be seen as a generalization ... together.
1 Introduction
Type-logical grammars offer a clear cut between
syntax and semantics. On the one hand, lexical
items are assigned syntactic categories that com-
bine...
Từ khóa: