tech,13-3-H01-1041,bq |
</term>
include : ( i ) Robust efficient
<term>
|
parsing
|
</term>
of
<term>
Korean
</term>
( a
<term>
verb
|
#452
The key features of the system include: (i) Robust efficientparsing of Korean (a verb final language with overt case markers, relatively free word order, and frequent omissions of arguments). |
other,29-2-P01-1007,bq |
without increasing their
<term>
worst-case
|
parsing
|
time complexity
</term>
. For example , after
|
#1651
In particular, range concatenation languages [RCL] can be parsed in polynomial time and many classical grammatical formalisms can be translated into equivalent RCGs without increasing their worst-case parsing time complexity. |
tech,6-6-J05-1003,bq |
the
<term>
boosting method
</term>
to
<term>
|
parsing
|
</term>
the
<term>
Wall Street Journal treebank
|
#8792
We apply the boosting method toparsing the Wall Street Journal treebank. |
other,9-4-P80-1026,bq |
In this paper , we outline a set of
<term>
|
parsing
|
flexibilities
</term>
that such a system
|
#12747
In this paper, we outline a set ofparsing flexibilities that such a system should provide. |
tech,9-1-C82-1054,bq |
of modifications to the
<term>
left corner
|
parsing
|
algorithm
</term>
for
<term>
context-free grammars
|
#12800
This paper proposes a series of modifications to the left corner parsing algorithm for context-free grammars. |
tech,1-1-P84-1047,bq |
entity-oriented approach to restricted-domain
|
parsing
|
</term>
is proposed . In this approach ,
|
#13327
An entity-oriented approach to restricted-domain parsing is proposed. |
tech,7-2-J86-1002,bq |
</term>
is done by strongly biasing
<term>
|
parsing
|
</term>
toward expected
<term>
meanings
</term>
|
#14021
Error correction is done by strongly biasingparsing toward expected meanings unless clear evidence from the input shows the current sentence is not expected. |
tech,15-1-C88-1066,bq |
Restrictions ( CCRs )
</term>
and describes two
<term>
|
parsing
|
algorithms
</term>
that interpret it .
<term>
|
#15255
This paper summarizes the formalism of Category Cooccurrence Restrictions (CCRs) and describes twoparsing algorithms that interpret it. |
tech,0-1-C88-2132,bq |
analysis of our
<term>
corpus
</term>
.
<term>
Chart
|
parsing
|
</term>
is
<term>
directional
</term>
in the
|
#15498
Chart parsing is directional in the sense that it works from the starting point (usually the beginning of the sentence) extending its activity usually in a rightward manner. |
tech,28-3-A92-1026,bq |
technique called
<term>
terminal substring
|
parsing
|
</term>
. For
<term>
pragmatics processing
</term>
|
#17486
We describe three techniques for making syntactic analysis more robust---an agenda-based scheduling parser, a recovery technique for failed parses, and a new technique called terminal substring parsing. |
tech,6-1-A92-1027,bq |
algorithm for
<term>
chart-based phrase structure
|
parsing
|
</term>
of
<term>
natural language
</term>
that
|
#17552
We present an efficient algorithm for chart-based phrase structure parsing of natural language that is tailored to the problem of extracting specific information from unrestricted texts where many of the words are unknown and much of the text is irrelevant to the task. |
tech,8-1-C92-2068,bq |
expensive part of
<term>
unification-based grammar
|
parsing
|
</term>
. We focus on one speed-up element
|
#17956
Graph unification remains the most expensive part of unification-based grammar parsing. |
tech,1-2-C92-3165,bq |
understanding
</term>
. The
<term>
generalized LR
|
parsing
|
</term>
is enhanced in this approach .
<term>
|
#18152
The generalized LR parsing is enhanced in this approach. |
tech,10-5-H92-1026,bq |
best existing robust
<term>
probabilistic
|
parsing
|
models
</term>
, which we call
<term>
P-CFG
|
#19018
In head-to-head tests against one of the best existing robust probabilistic parsing models, which we call P-CFG, the HBG model significantly outperforms P-CFG, increasing the parsing accuracy rate from 60% to 75%, a 37% reduction in error. |
other,1-2-H92-1060,bq |
analysis
</term>
fails . This
<term>
robust
|
parsing
|
capability
</term>
was achieved through minor
|
#19366
This robust parsing capability was achieved through minor extensions of pre-existing components already in place for the full linguistic analysis component. |
tech,4-1-C94-1061,bq |
concurrent , object-oriented natural language
|
parsing
|
</term>
is introduced . Complete
<term>
lexical
|
#20822
A grammar model for concurrent, object-oriented natural language parsing is introduced. |
tech,0-3-C94-1077,bq |
</term>
in a
<term>
chart
</term>
.
<term>
Chart-like
|
parsing
|
</term>
and
<term>
semantic-head-driven generation
|
#20917
Chart-like parsing and semantic-head-driven generation emerge from this method. |
tech,5-2-C94-1082,bq |
The system uses a robust
<term>
island-based
|
parsing
|
method
</term>
controlled by
<term>
user-defined
|
#21119
The system uses a robust island-based parsing method controlled by user-defined performance thresholds. |
tech,25-1-C94-2151,bq |
<term>
coordination
</term>
using adapted
<term>
|
parsing
|
strategies
</term>
, in a similar fashion
|
#21152
Despite the large amount of theoretical work done on non-constituent coordination during the last two decades, many computational systems still treat coordination using adaptedparsing strategies, in a similar fashion to the SYSCONJ system developed for ATNs. |