... Type precision and recall and F-measure
recall and F-measure. Type precision is the per-
centage of SCF types that our system proposes
which are correct according some gold standard
and type recall ... standard. We used the 14 verbs
4
selected
by Briscoe and Carroll (1997) and evaluated our
results of these verbs against the SCF entries in
two gold standards: COMLEX (Grishman et al.,
1994) and ... (Bikel, 2004) in parsing written and
spoken language and in generating sub-
categorization cues from written and spo-
ken language. Although Bikel’s parser
achieves a higher accuracy for parsing
written...
... the n-best parses using
coarse-to-fine parsing
The major difficulty in n-best parsing, compared to
1-best parsing, is dynamic programming. For exam-
ple, n-best parsing is straight-forward in best-first
search ... 2001. Probabilistic top-down parsing
and language modeling. Computational Linguistics,
27(2):249–276.
R. Schwartz and Y.L. Chow. 1990. The n-best algo-
rithm: An efficient and exact procedure for finding
the ... of a standard
context-free grammar. He parses a sentence using
the approximate grammar, and the results are used
to constrain the search for a parse with the full CFG.
He finds that total parsing...
... S=:'aA,~=:'a#~ and
(2) S=%,Bx=~-~,~x = a'B,b
are rightmost derivations in the grammar;
(3) the length ofx is less than or equal to the length of,/,
and
(4) the last m symbols of a and a' ...
and
(4) the last m symbols of a and a' coincide,
and the first n symbols of,., and ~, coincide
imply that A=B,
a'=v,
and ,/' = x.
We will u~ the term "bounded context" ... rightmost and use instead non-canonical
derivation sequences as defined by Szymanski and Williams (1976).
This model corresponds to Marcus's (1980) use of
attention shi.Bs
to
postpone parsing...
... between
shift and reduce operations and between different reduce
operations. Shieber and Pereira demonstrate that if
shift/reduce clashes are resolved in favour of shifting and
reduce/reduce ... analysis and
storage of partially analysed material in thc left and fight
context. Parsing proceeds on the basis of a three cell
window into the stack. The item in the first cell (at the
fight hand ... Ceil2 and Cell3 using rules of
backward and forward application and a more constrained
rule of forward composition. If this fails, then Lexicat
shifts. This completes one step of the parsing...
... bilingual cor-
pora, and use some thresholds to filter out noise
and some hand-written rules to handle heterogene-
ity. Smith and Eisner (2009) perform depen-
dency projection and annotation adaptation ... noise,
and some hand-designed rules to handle language
heterogeneity. Smith and Eisner (2009) perform
dependency projection and annotation adaptation
with quasi-synchronous grammar features. Jiang
and ... dependency parsing
(Klein and Manning, 2004) which is totally based
on unannotated data, and the semisupervised de-
pendency parsing (Koo et al., 2008) which is
based on both annotated and unannotated...
... general
framework of constituent parsing to utilize more
lexical and structural context and incorporate more
strength of various parsing techniques. However,
higher-order constituent parsing inevitably leads ... of each parsing model are estimated from a
training set using an averaged perceptron algorithm,
following Collins (2002) and Huang (2008).
The performance of our first- and higher-order
parsing ... Computational Linguistics
Higher-Order Constituent Parsingand Parser Combination
∗
Xiao Chen and Chunyu Kit
Department of Chinese, Translation and Linguistics
City University of Hong Kong
Tat...
... include speech recog-
nition and synthesis. Thus, the processing time
of speech recognition and transfer text-to-speech
synthesis is zero, and the speaker’s utterance time
and the interpreter’s utterance ... incremental parsing, transfer and
generation. In the parsing module the parser deter-
mines the English dependency structure for input
words incrementally. In the transfermodule, struc-
ture and lexicon ... we have not implemented the method Z.
And we virtually compute the delay time and the
utterance time. Table 1 shows the estimation re-
sults of methods X, Y and Z. Note, however, that
we virtually...
... (Bikel, 2004) in parsing written and
spoken language and in generating sub-
categorization cues from written and spo-
ken language. Although Bikel’s parser
achieves a higher accuracy for parsing
written ... verb disambigua-
tion and classification (Schulte im Walde, 2000;
Merlo and Stevenson, 2001; Lapata and Brew,
2004; Merlo et al., 2005) and SCCs for semantic
role labeling (Xue and Palmer, 2004; Punyakanok
et ... Charniak, and M. Johnson. 2002. Parsing
and disfluency placement. In Proceedings of 2002
Conference on Empirical Methods of Natural Lan-
guage Processing, pages 49–54.
J. Godefrey, E. Holliman, and...
... →
(e→t)→(e→t)→t,
N → e→t}). A rule that has A on
the left-hand side and B
1
, ,B
n
as right-hand side
nonterminals has its left-hand side annotated with a
well-formed λ-term M that has type ... of Science and Technology.
Beeri, Catriel and Raghu Ramakrishnan. 1991. On the
power of magic. Journal of Logic Programming 10,
255–299.
Engelfriet, J. and E. M. Schmidt. 1977. IO and OI, part
I. ... Fujii, and
Tadao Kasami. 1991. On multiple context-free gram-
mars. Theoretical Computer Science 88, 191–229.
Shieber, Stuart M., Yves Schabes, and Fernando C. N.
Pereira. 1995. Principles and implementations...
... definition:
If the productions at and are different
.
If the productions at and are the same, and
and are pre-terminals, then .
5
Else if the productions at and are the same
and and are not pre-terminals,
where ... state labels at and are different
.
If the state labels at and are the same,
but the words at and are different, then
.
Else if the state labels at and are the
same, and the words at and are the ... Random Field methods of
(Johnson et al. 1999), and the boosting approaches
for parsing in (Collins 2000). The set-up is as fol-
lows:
Training data is a set of example input/output
pairs. In parsing...
... human parsing processes can we cover all and
only
the language
phenomena that
we
are
called
upon to
process. A particular (extraordinary) aspect of hu~an
cognitive (and hence, parsing) ... the other hand, on the b,m- parsing side, we
definitely feel that natural language is strongly tuned
to both people's means of production and their means of
recognition,
and
that principles ... understandable
and
reasonable,
to
constrain
what
the
system should
be doing.
The Interaetlons
Finally, we have been asked about the nature of the
relationship between a gr~mar and a...
... grammar in terms of its behavior both
in parsingand in generation.
References
Baschung,
K, G.G. Bes, A.
Corluy, and T. Guillotin
(1987) "Auxiliaries and Critics in French
UCG
Grammar". ... classes of parsable analyses.
1.
Introduction
Parsing and generation me both concerned with the
relation between texts and representations, and in
so far as a grammar defines this relation ...
UD (Unification Device) which includes the parser
and facilities such as procedural abswactions and
extended data types (lists and trees) and Estival et
al. (1989) for a description of the...