... challenging baseline
methods.
1 Introduction
This paper presents a method for debate-side clas-
sification, i.e., recognizing which stance a per-
son is taking in an online debate posting. In on-
line ... that are indicative of opinion stances
in debates. We combine this knowledge
with discourse information, and formu-
late the debate side classification task as
an Integer Linear Prog...
... change in speaker has occurred between
the current and previous contribution.
4.3 Constraints using Integer Linear
Programming
We formulate our constraints using Integer Linear
Programming (ILP). ... enforcing these
rules in the output of our automatic classifier, per-
formance will increase. In section 4.3 we formalize
these constraints using Integer Linear Programming.
4.1 Challenging...
... such that it prefers that an interrogating agent not
find out the requested information. This might block the
formation of an intention to inform, but what is it that inspires
the agent to respond ... the role of the dialogue manager
in the TRAINS dialogue system which acts as an intelligent
planning assistant in a transportation domain. While this is
a domain where the assumption of...
... subjects of finite verbs have nomina-
tive case, so in the FINITE class frame we stipulate
(CASE NOMINATIVE) for the subject. If we used the
complete mode of inheritance in determining the case ... grammatical information
appearing in the
make
entry below is a consequence
of our maintaining the strong position that only infor-
mation which is idiosyncratic should be included in...
... of weblogs. In Proceedings of the 37th Hawaii
International Conference on System Sciences.
Dan Klein and Christopher D. Manning. 2003a. Ac-
curate unlexicalized parsing. In Proceedings of the
41st ... are not used in our
classification experiments. We then pruned the
list of interests by excluding any interest that
occurred within a +/-10 window (based on its
position in the list) in...
... source
domain training set. Wu et al. (2009) propose an-
other bootstrapping algorithm that selects bridging
instances from an unlabeled target domain, which
are informative about the target domain and ... o.
Require: Training tweets ts; gazetteers ga.
1: Initialize l
s
, the CRF labeler: l
s
= train
s
(ts).
2: Initialize l
k
, the KNN classifier: l
k
= train
k
(ts).
3: Initialize n, the # of...
... concepts were combined into
a single finite state machine (one for each concep-
tual area). By examining the number of states and
transitions in the compiled finite state graphs, some
indication of their ... using the same approach as the oth-
ers, but were not completed in time to be included
in our performance evaluation.
After authoring these local grammars using the
Intex Corpus Pro...
... preprocessing simply in-
cluded down-casing, separating punctuation from
words and splitting off “’s”.
OOV Handling Techniques and their Combina-
tion We compare our baseline system (BASELINE)
to ... morpholog-
ically related to in- vocabulary (INV) words (Yang
and Kirchhoff, 2006). Vilar et al. (2007) address
spelling-variant OOVs in MT through online re-
tokenization into letters and...
... as in the following:
(8) VP(missing
?a) ~
V NP NP(missing
?a)
(9) VP(missing ?a) ~ V NP(missing ?a) NP
(I0) VP(missing ?a) > V(missing ?a) NP NP
This would cause an unwarranted increase ...
cally errors in subject-verb agreement
•
ED: extra determiner
• MD: missing determiner for an NP that re-
quires a determiner
• ID: incorrect determiner
In addition to testing sentenc...