C. Raymond Perrault
University of Toronto
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by C. Raymond Perrault.
Artificial Intelligence | 1980
James F. Allen; C. Raymond Perrault
This paper describes a model of cooperative behavior and describes how such a model can be applied in a natural language understanding system. We assume that agents attempt to recognize the plans of other agents and, then, use this plan when deciding what response to make. In particular, we show that, given a setting in which purposeful dialogues occur, this model can account for responses that provide more information that explicitly requested and for appropriate responses to both short sentence fragments and indirect speech acts.
meeting of the association for computational linguistics | 1983
C. Raymond Perrault
Metatheoretical findings regarding the decidability, generative capacity, and recognition complexity of several syntactic theories are surveyed. These include context-free, transformational, lexical-functional, generalized phrase structure, tree adjunct, and stratificational grammars. The paper concludes with a discussion of the implications of these results with respect to linguistic theory.
Intelligence\/sigart Bulletin | 1978
C. Raymond Perrault
A competence theory of speech acts should account at least for the relationship between the intentions and beliefs of the speaker of an utterance (including his beliefs about his hearers beliefs and intentions), and the form of the utterance. What utterances can be used in what contexts to convey what intentions?
Information Sciences | 1976
C. Raymond Perrault
Abstract Augmented Transition Network Parsers (ATN) were defined by Woods and used by him in a natural language understanding system. Every recursively enumerable set is recognizable by an ATN. We define the Basic ATN, a limited class of ATN, and show that the languages accepted by this class are exactly those generated by a single top-down finite-state tree transducer, as defined by Rounds and Thatcher. These languages are known to be context-sensitive but have an NP-complete recognition problem.
Computational Linguistics | 1980
C. Raymond Perrault; James F. Allen
Archive | 1981
Philip R. Cohen; C. Raymond Perrault; James F. Allen
Lecture Notes in Computer Science | 1988
Philip R. Cohen; C. Raymond Perrault
theoretical issues in natural language processing | 1978
C. Raymond Perrault; James F. Allen; Philip R. Cohen
Cognitive Science | 1979
Philip R. Cohen; C. Raymond Perrault
Archive | 1981
C. Raymond Perrault; Philip R. Cohen