Eng · 繁體 · 简体

News & Events

 News & Events Home
 News and Events Archive
Research Seminar : Non Sentential Utterances: Meaning, Content, and Complexity
Jump To:
Topic:  Research Seminar : Non Sentential Utterances: Meaning, Content, and Complexity
posted itemPosted - 24/06/2008 :  11:32:37
City University of Hong Kong Dep

Department of Chinese, Translation and Linguistics
Research Seminar

Non Sentential Utterances: Meaning, Content, and Complexity

Presented by

Prof. Jonathan Ginzburg

Department of Computer Science, King's College, London

Date: 10 July 2008, Thursday
Time: 4:30pm - 6:00pm
B7516 (Lift 3, 7/F, Blue Zone), Academic Building, CityU


Non sentential utterances (NSUs), examples of which are in (1)-(4), are pervasive in conversation: (1) A: Did Bo leave? B: Yes / No, Jo/ Bo? (2) A: Did Bo ... B: leave? (3) A: Did Bo ... No, Jo leave? (4) A: [in a ticket office] A return to Maidenhead please. NSUs have had a rather mixed reputation in theoretical and computational linguistics. Beliefs about the intrinsic messiness of conversation, in particular its being littered with fragments, have been used as important motivation for a strong modularity assumption in language acquisition (starting with Chomsky 1965, 1972 but persisting to this day in textbooks). Conversely, computational linguists have argued that fragment resolution generally requires plan recognition techniques (e.g. Allen and Perrault, 1980; Carberry, 1991). The starting point for this talk will be recent work, jointly with Raquel Fernàndez and Shalom Lappin, showing that conversational NSUs are actually amenable to domain independent classification: a taxonomy of fewer than 20 classes reliably classifies the NSUs in the British National Corpus and the taxonomy can be learnt by a variety of machine learning algorithms. I will show that given a sufficiently detailed theory of conversational interaction (as exemplified by the theory sketched in my first talk), fragment resolution is relatively straightforward, akin in a sense to the resolution of traditional indexical elements. I will show how to associate a hierarchy of complexity among NSUs and discuss some predictions this makes about the order of acquisition of NSUs.


Jonathan Ginzburg received his PhD at Stanford. He has held research posts at Edinburgh, Gothenburg, and Potsdam and is currently a senior lecturer at the Department of Computer Science, King's College, London.

~ All Are Welcome ~

CTL Technical Support


Enquiry: LTenquiry@cityu.edu.hk