Báo cáo khoa học: "Towards Developing Generation Algorithms for Text-to-Text Applications" pot
Báo cáo khoa học: "Towards Developing Generation Algorithms for Text-to-Text Applications" pot
... Association for Computational Linguistics
Towards Developing Generation Algorithms for Text-to-Text Applications
Radu Soricut and Daniel Marcu
Information Sciences Institute
University of Southern California
4676 ... or problematic. For
instance, as already argued, the representation for-
malism of all previous proposals except for IDL is
problematic (
) for text-to-text...
Báo cáo khoa học: "An Automatic Generation System for Grammar Tests" pot
...
automatic generation of 6 types of vocabulary
questions by employing data from WordNet.
I intend _______ you that we cannot approve your
application.
(A) to inform
(B) to informing
(C) informing ...
questions indicates that the proposed
method performs satisfactory quality.
Our methodology provides a promising
approach and offers significant potential
for computer assisted lang...
Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt
...
whether it is well-formed or ill-formed.
• maximal
iff it is well-formed and its parent (if it
has one) is ill-formed. In other words, a maxi-
mal TNCB is a largest well-formed component
of ... Shake-and-Bake generation
algorithm of (Whitelock, 1992) is NP-
complete. We present a polynomial time
algorithm for lexicalist MT generation pro-
vided that sufficient information can...
Tài liệu Báo cáo khoa học: "TOWARDS A CORE VOCABULARY FOR SYSTEM A NATURAL LANGUAGE" potx
...
occurs but not its antonym
re&milch
(male).
For a core vocabulary to bc set up for a
natural language system, 1 think, tmc must strive
for lingt, istic closure, since otherwise, one cnds ... reasonable effort
to
a vail-
ely of subjccl domains. It is common under-
standing that there cxisls
a
t:t:llhal [i'aglnt'.tlt of a
language which I. is required for dealin...
Báo cáo khoa học: "Local and Global Algorithms for Disambiguation to Wikipedia" pot
... be informative for
many documents. The intuition for also including
the maximum relatedness is that for longer docu-
ments that may cover many different subtopics, the
maximum may be more informative ... but
still enforces some degree of coherence among the
disambiguations.
3 Related Work
Wikipedia was first explored as an information
source for named entity disambiguation and in-
form...
Báo cáo khoa học: "Towards a proper treatment of coercion phenomena" potx
... semantic information.
This program, at least in this strong form, encoun-
ters empirical difficulties. For instance, it is not the
case that the class of aspectual verbs which subcate-
gorize for ... investigation is necessary for generic
NPs
which exhibit restrictions
X) iff P holds for z t_l y whenever P holds for x and
y in X. A predicate is singular on X iff it holds fo...
Báo cáo khoa học: "TOWARDS AN INTEGRATED ENVIRONMENT FOR SPANISH DOCUMENT VERIFICATION AND COMPOSITION" pptx
... marked.
3. There are additional marks for hyphenation
points (for later use by a formatter performing
automatic syllable partition), and several other
for foreign and Latin words, geographical ... used in the
generation of inflected forms starting from the
previous base forms. A list of paradigms has been
built for each category of nouns, adjectives and verbs,
to account for...
Báo cáo khoa học: "Graph-based Ranking Algorithms for Sentence Extraction, Applied to Text Summarization" pdf
... final score computed for
each vertex, using the PR formula, applied on an undi-
rected graph. The sentences with the highest rank are
selected for inclusion in the abstract. For this sample
article, ... Page, 1998) is perhaps one of the
most popular ranking algorithms, and was designed as
a method for Web link analysis. Unlike other ranking
algorithms, PageRank integrates the impact...
Báo cáo khoa học: Designing highly active siRNAs for therapeutic applications pdf
... a
concern only for a chronic therapy, for which short,
hairpin RNAs, which are related in structure and
function to both siRNAs and microRNAs, are more
suitable [21]. For further information about ... the rules for selecting
siRNA sequences
As the field of RNAi has grown, the rules for selecting
candidate siRNA sequences have become more com-
plex. The initial selection of agents fo...
Báo cáo khoa học: "Semi-supervised Convex Training for Dependency Parsing" potx
... results in many supervised learning tasks.
As a result, many researchers have put effort on
developing algorithms for semi-supervised SVMs
(S3VMs) (Bennett and Demiriz, 1998; Altun et
al., 2005). ... unlabeled
data resource. Our goal is to obtain better perfor-
mance than a purely supervised approach without
unreasonable computational effort. Unfortunately,
although significant recent pr...
Từ khóa: