... major syntactic argument for adopt-
ing this classification: adjectives belonging to the
same class coordinate when modifying the same
noun, but adjectives from different classes do not:
*A serious ... Morphologically sim-
ple adjectives and very ambiguous suffixes, as
far as adjective classes are concerned, were not
classified. No information could be gathered for
nonpredicative...
... 2007.
c
2007 Association for Computational Linguistics
Clustering Clauses for High-Level Relation Detection: An
Information-theoretic Approach
Samuel Brody
School of Informatics
University of ... of the clusters. For instance, we had
a cluster of countries involved in military con-
flicts, and another for other countries; a cluster
for winning game scores, and another for ties;
et...
... Transforming the entire for-
est to n-ary form is intractable, however, because
the number of hyperedges would be exponential in
n. Instead, we include only the top k n-ary back-
traces for each forest ... Collapsing Binarization
To facilitate a change in binarization, we transform
the translation forest into n-ary form. In the n-ary
forest, each hyperedge corresponds to an original
gramm...
... Equivalents. If the new form is
a form of a word in the old glossary, the Eng-
lish equivalents previously used are carried
forward. If no form of the word has occurred
before, the linguist assigns ... different occurrences of
the same form.
Research Methodology 9
10 Edmundson and Hays
Word: a form that represents a set of forms
differing only in inflection. For example,
"...
... node, e.g., PRPˆNP
4
→ “you”.
4 Experimental Results
For all classification tasks, we use SVM classi-
fier, 80% of data for training and 20% for test-
ing, with 5-fold cross validation.
2
All features
are ... using Amazon
Mechanic Turk for the following three topics:
“Abortion” (100 essays per class) , “Best Friend”
(98 essays per class) , and “Death Penalty” (98
essays per class) ....
... for
linguistic formalisms. For lack of space, some
proofs are omitted; an extended version is avail-
able as a technical report (Wintner, 1999).
2 Grammar semantics
Viewing grammars as formal ... of grammatical formalisms. For the
following discussion fix a particular grammar
G = (n,E,A~).
Definition 5. Let Tc : Z -+ Z be a trans-
formation on sets o.f items, where .for every...
... number of standard devices are available
for coding the incoming text for insertion into
the machine and, after the translation process
is completed, for decoding and printing the
translation ... its original
form, the dissection scheme for endings and
compounds can be tried; if this fails, the word
can be printed through without alteration.
Several methods are available for...
... =
i
f
i
log(
c
p(vt
i
|c)p(n
i
|c)p(c)). (2)
3
This formulation is based on the formulation presented in
Rooth et al. (1999) for English.
408
We iteratively update the probabilities using the EM
algorithm. For the update procedures ... then split the matrix for the model parameters,
p(n|c) and p(vt|c), along with the class coordinate.
That is, each cluster node is responsible for...
... “tedious” (class 1) versus “straightforward”,
“likeable” (class 2). Some unexpected distinguish-
ing terms for this author are “lion” for class 2 (three-
class case), and for class 2 in the four -class ... some examples for one author are:
“meaningless”, “disgusting” (class 0); “pleasant”,
“uneven” (class 1); and “oscar”, “gem” (class 2)
for the three -class case, and,...
... computational tool for
inferring, given multiple classes (or, a typology),
with attendant instances of these classes, the pro-
files (=descriptions) of these classes such that every
class is contrasted ... learning, in which from multiple given
classes (i.e. a typology) the profiles of these classes
are inferred, such that every class is contrasted from
every other class by feat...