Báo cáo khoa học: "An Improved Heuristic for Ellipsis Processing*" ppt
Báo cáo khoa học: "An Improved Heuristic for Ellipsis Processing*" ppt
... An Improved Heuristic for Ellipsis Processing*
Ralph M. Welschedel
Department of Computer & Information Sciences
University of Delaware
Newark, ... will be formally equivalent in
predictive power to a grammar for ellipti-
cal forms.
Though the heuristic is independent
of the individual grammar, designating
expansion paths and transformations ... Hendrix et
al., 1978;...
Tài liệu Báo cáo khoa học: "An Improved Parser for Data-Oriented Lexical-Functional Analysis" doc
... An Improved Parser for Data-Oriented Lexical-Functional Analysis
Rens Bod
Informatics Research Institute, University of Leeds, Leeds LS2 9JT, UK, &
Institute for Logic, Language ... frag-
ment size is confirmed for LFG-DOP; (3) LFG-
DOP's relative frequency estimator performs
worse than a discounted frequency estimator; and
(4) LFG-DOP significantly outperforms Tree-
DOP if e...
Tài liệu Báo cáo khoa học: "An Improved Redundancy Elimination Algorithm for Underspecified Representations" pdf
... 1 for the entire graph G. After
this deletion, the splits for G with root fragments
2 and 3 are still eliminable; so we can e.g. delete
the split for 3. At this point, only one split is left
for ... by checking each split
for eliminability before it is added to the chart.
We compare the performance of this algorithm to
the baseline of computing the complete chart. For
comparison,...
Tài liệu Báo cáo khoa học: "AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION" docx
... fea-
tures are designed to be general and, for the most part,
grammar and domain independent. For each parse, the
heuristic computes a penalty score for each of the fea-
tures. The penalties ... recent work on de-
veloping an integrated heuristic scheme for selecting the
parse that is deemed "best" from such a collection. We
describe the heuristic measures used a...
Báo cáo khoa học: "An Improved Extraction Pattern Representation Model for Automatic IE Pattern Acquisition" ppt
... approaches have been described
for the automatic unsupervised acquisi-
tion of patterns for information extraction.
Each approach is based on a particular
model for the patterns to be acquired, ... the
proposed Subtree model outperforms the previous
models.
Section 2 describes the Subtree model for extrac-
tion pattern representation. Section 3 shows the
method for automatic acquisi...
Báo cáo khoa học: "An Improved Error Model for Noisy Channel Spelling Correction" ppt
... Èg tÈs uÈu aÈa lÈl
To allow for richer contextual
information, we expand each nonmatch
substitution to incorporate up to N additional
adjacent edits. For example, for the first
nonmatch edit ... that assigns uniform
probability to all words in the dictionary. In
Table 1 we show K-best results for different
maximum context window sizes, without
using positional information. For insta...
Tài liệu Báo cáo khoa học: "An Unsupervised Model for Joint Phrase Alignment and Extraction" ppt
... method.
636
Figure 3: The phrase, block, and word alignments used
in heuristic phrase extraction.
5.1 Heuristic Phrase Extraction
The traditional method for heuristic phrase extrac-
tion from word alignments exhaustively ... generates word
alignments. It should be noted that forcing align-
ments smaller than the model suggests is only used
for generating alignments for use in heu...
Tài liệu Báo cáo khoa học: "An Ensemble Method for Selection of High Quality Parses" pdf
... clutter,
for the filter f-score measure we use the maximum
recall (MR) baseline rather than the minimum length
(ML) baseline, since the former outperforms the lat-
ter. Thus, ML is only shown for the ... from
different domains. For a test setting used by
previous work, we show an error reduction
of 31% as opposed to their 20%.
1 Introduction
Many algorithms for major NLP applications s...
Tài liệu Báo cáo khoa học: "An Approximate Approach for Training Polynomial Kernel SVMs in Linear Time" doc
... Association for Computational Linguistics
An Approximate Approach for Training Polynomial Kernel SVMs in
Linear Time
Yu-Chieh Wu Jie-Chi Yang
Yue-Shi Lee
Dept. of Computer Science and
Information ... methods, for example support vector
machines (SVM) (Vapnik, 1995) are successfully
applied to many natural language processing (NLP)
problems. They yielded very competitive and
s...
Tài liệu Báo cáo khoa học: "An Integrated Environment for Computational Linguistics Experimentation" pot
... that the LinguaStream platform
promotes the combination of purely declarative
formalisms (when GATE is mostly based on the
JAPE language and NOOJ focuses on a unique
formalism), and allows processing ... analy-
sis models and methodological concerns. Finally,
when other platforms usually enforce the use of a
dedicated document format, LinguaStream is able
to process any XML document. On the o...