Agustín Gravano, Stefan Benus, Julia Hirschberg, Shira Mitchell, Ilia Vovsha
We present results of a series of machine learning experiments that address the classification of the discourse function of single affirmative cue words such as alright, okay and mm-hm in a spoken...
The Effect of Contour Type and Epistemic Modality on the Assessment of Speaker Certainty (2009)
Agustín Gravano, Stefan Benus, Julia Hirschberg, Elisa Sneed German, Gregory Ward
In an empirical study participants were asked to rate the perceived degree of certainty of utterances that contained either the modal would or main verb be (e.g. That would be me vs. That’s me),...
Julia Hirschberg, Agustín Gravano, Ani Nenkova, Elisa Sneed, Gregory Ward
Intonational contours are overloaded, conveying different meanings in different contexts. In this paper we examine two potential uses of the downstepped contours in Standard American English, in the...
INTERSPEECH 2007 Prosody, emotions, and … ‘whatever’ (2008)
Stefan Benus, Agustín Gravano, Julia Hirschberg
We examine the role of prosody in cueing a scale of negative meanings associated with the use of whatever. The analysis of a corpus of elicited examples shows that the more negative the token, the...
❍❍❍ ❥ no Simultaneous speech present? Simultaneous speech present? yes✟ (2008)
Developed Julia Hirschberg, Stefan Benus, Agustín Gravano, Héctor Chávez, Turn Exchanges, Turns Tier
Henestroza, and based on the labeling scheme proposed in [Beattie 1982].
On a Conjecture Concerning Helly Circle Graphs (2008)
Guillermo Durán, Agustín Gravano, Marina Groshaus, Fábio Protti, Jayme L. Szwarcfiter
We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding...
Universidade Federal do Rio de Janeiro Rio de Janeiro – RJ – Brasil (2008)
Guillermo Durán, Agustín Gravano, Marina Groshaus, Fábio Protti, Jayme L. Szwarcfiter
We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding...
High frequency word entrainment in spoken dialogue (2008)
Ani Nenkova, Agustín Gravano, Julia Hirschberg
Cognitive theories of dialogue hold that entrainment, the automatic alignment between dialogue partners at many levels of linguistic representation, is key to facilitating both production and...
The prosody of backchannels in American English (2007)
Stefan Benus, Agustín Gravano, Julia Hirschberg
We examine prosodic and contextual factors characterizing the backchannel function of single affirmative words. Data is drawn from collaborative task-oriented dialogues between speakers of Standard...
The prosody of backchannels in American English (2007)
Stefan Benus, Agustín Gravano, Julia Hirschberg
We examine prosodic and contextual factors characterizing the backchannel function of single affirmative words. Data is drawn from collaborative task-oriented dialogues between speakers of Standard...
The role of context and prosody in the interpretation of okay (2007)
Agustín Gravano, Stefan Benus, Héctor Chávez, Julia Hirschberg, Lauren Wilcox
We examine the effect of contextual and acoustic cues in the disambiguation of three discourse-pragmatic functions of the word okay. Results of a perception study show that contextual cues are...
This thesis proposal describes completed and future studies on three particular aspects of prosodic variation in American English spoken dialogue: how information status affects the way humans decide...
Polynomial time recognition of unit circular-arc graphs (2006)
Durán, Guillermo, Gravano, Agustín, McConnell, Ross M., Spinrad, Jeremy, Tucker, Alan
We present an efficient algorithm for recognizing unit circular-arc (UCA) graphs, based on a characterization theorem for UCA graphs proved by Tucker in the seventies. Given a proper circular-arc...
On a conjecture concerning helly circle graphs (2003)
Durán,Guillermo, Gravano,Agustín, Groshaus,Marina, Protti,Fábio, Szwarcfiter,Jayme L.
We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding...