Báo cáo khoa học: "A Progressive Feature Selection Algorithm for Ultra Large Feature Spaces" doc
Báo cáo khoa học: "A Progressive Feature Selection Algorithm for Ultra Large Feature Spaces" doc
... pages 561–568,
Sydney, July 2006.
c
2006 Association for Computational Linguistics
A Progressive Feature Selection Algorithm for Ultra
Large Feature Spaces
Qi Zhang
Computer Science Department ... progressive
feature selection (PFS) algorithm: the PFS
algorithm maintains the same accuracy per-
formance as previous CME feature selection
algorithms (e.g.,...
Báo cáo khoa học: "A Joint Rule Selection Model for Hierarchical Phrase-based Translation" pptx
... statistical models are integrated to
guide the hierarchical rule selection for
better translation performance. Previous
work mainly focused on the selection of
either the source side of a hierarchical rule
or ... context information of non-terminals
to predict the target-side rule selection. Different
from the above work where the probability dis-
tribution of source-side rule selecti...
Tài liệu Báo cáo khoa học: "A Best-First Search Algorithm for Generating Referring Expressions" pot
... A Best-First Search Algorithm for Generating Referring Expressions
Helmut Horacek
Uniyersitat des Saarlandes, FR 6.2 Informatik
Postfach 151150, D-66041 Saarbdicken, ...
except the
intended referent(s).
Several algorithms have been developed for
this purpose, differing in terms of computational
efficiency, quality and coverage. For identifying
sets of objects rather ... considerable...
Tài liệu Báo cáo khoa học: "AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES " pot
... to
incorporate feature- based categories into
Tomita's extended LR parsing algorithm
(Tomita 1986).
A straightforwmd adaptation of feature-
based categories into the algorithm introduces ...
tsuneko@grice.cogsci.uiuc.edu
ABSTRACT
This paper proposes an LR parsing
algorithm modified for grammars with
feature- based categories. The proposed
algorithm does not instantia...
Báo cáo khoa học: "A Web-based Evaluation Framework for Spatial Instruction-Giving Systems" docx
... Association for Computational Linguistics, pages 49–54,
Jeju, Republic of Korea, 8-14 July 2012.
c
2012 Association for Computational Linguistics
A Web-based Evaluation Framework for Spatial ... navigation instructions in the real world
for pedestrians is an interesting research problem
for researchers in both computational linguistics
and geo-informatics (Dale et al., 2003; Richte...
Báo cáo khoa học: "A Beam-Search Extraction Algorithm for Comparable Data" pptx
... positions
long to generate a non-zero feature value . In the
feature vector f (c, S, T ), each feature f
i
occurs
potentially twice, once for each class c ∈ {0, 1}.
For the feature vector f(c = 1, S, T ... all
the English documents that have been published
within a 7 day window of the source document.
We select the 20 highest scoring English docu-
ments for each source document...
Báo cáo khoa học: "A Morphologically Sensitive Clustering Algorithm for Identifying Arabic Roots" docx
... clustering algorithm to
ensure comparability.
4.3 Testing the Two-stage Algorithm
Table 8 shows the results of the Two-stage
algorithm for our data sets. The maximally
effective cut of point for all ... however, assume text to be in
perfect (some even vowelised) form, forcing the
need for editing prior to processing. Finally, the
success of these algorithms depends critically on
r...
Báo cáo khoa học: " A simple pattern-matching algorithm for recovering empty nodes and their antecedents∗" pot
... A simple pattern-matching algorithm for recovering empty nodes
and their antecedents
∗
Mark Johnson
Brown Laboratory for Linguistic Information Processing
Brown University
Mark
Johnson@Brown.edu
Abstract
This ... good average performance on all
empty nodes if it performs well on the most frequent
types of empty nodes, and conversely, a system will
perform poorly on average if it does no...
Báo cáo khoa học: "A Trainable Rule-based Algorithm for Word Segmentation" pdf
... therefore need only define an appropriate
rule syntax for transforming this initial approxima-
3The "existing" algorithm does not need to be a large
or even accurate system; the algorithm ... adopting it
for word segmentation. For example, since word seg-
mentation is merely a preprocessing task for a wide
variety of further tasks such as parsing, information
ext...
Báo cáo khoa học: "A Polynomial-Time Parsing Algorithm for TT-MCTAG" pot
... with Shared Nodes (Lichte,
2007)), or TT-MCTAG for short.
For some of the above formalisms the word
recognition problem is NP-hard. This has been
shown for non-local MCTAG (Rambow and Satta,
1992), ... derivation tree without deciding, for ev-
ery occurrence of some argument β, which of the
h(β)-nodes represents its head. Therefore we pro-
pose to reformulate (SN-TTL).
For a node v...