Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where C. Raymond Perrault is active.

Publication


Featured researches published by C. Raymond Perrault.


Artificial Intelligence | 1980

Analyzing intention in utterances

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

On the Mathematical Properties of Linguistic Theories

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

Some problems in planning indirect speech acts

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

Augmented tranśition networks and their relation to tree transducers

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

A plan-based analysis of indirect speech acts

C. Raymond Perrault; James F. Allen


Archive | 1981

Beyond Question-Answering.

Philip R. Cohen; C. Raymond Perrault; James F. Allen


Lecture Notes in Computer Science | 1988

Elements of a plan-based theory of speech acts

Philip R. Cohen; C. Raymond Perrault


theoretical issues in natural language processing | 1978

Speech acts as a basis for understanding dialogue coherence

C. Raymond Perrault; James F. Allen; Philip R. Cohen


Cognitive Science | 1979

Elements of a planbased theory of speech acts

Philip R. Cohen; C. Raymond Perrault


Archive | 1981

It's for Your Own Good: A Note on Inaccurate Reference.

C. Raymond Perrault; Philip R. Cohen

Collaboration


Dive into the C. Raymond Perrault's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Paul S. Cohen

University of Rhode Island

View shared research outputs
Researchain Logo
Decentralizing Knowledge