Victor Raskin
Research Subjects
Victor Raskin has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Julia M. Taylor
CIT & CERIAS and LING & CERIAS, Purdue University, West Lafayette, Indiana, USA
2 shared publications- Karthik Ramani
School of Mechanical Engineering, Purdue University, West Lafayette, Indiana, USA
2 shared publications - Zhanjun Li
Purdue University, West Lafayette, IN
2 shared publications - Benjamin C. M. Fung
School of Information Studies, McGill University, Montréal, Canada
1 shared publication Christian F. Hempelmann
1 shared publication- Christian F. Hempelmann
Purdue University, West Lafayette, IN, USA
1 shared publication
Latest Publications
- 21 March 2023
- Published by Walter de Gruyter GmbH in HUMOR
- Vol. 36 (2) , 197-205
The demise of the joke
Article The demise of the joke was published on March 21, 2023 in the journal HUMOR (volume 0, issue 0).
- 21 March 2023
- Published by Walter de Gruyter GmbH in HUMOR
- Vol. 36 (2) , 197-205
The demise of the joke
Article The demise of the joke was published on March 21, 2023 in the journal HUMOR (volume 0, issue 0).
- 22 July 2015
- Published by Springer Nature
- p. 671-679
On Algorithmic Discovery and Computational Implementation of the Opposing Scripts Forming a Joke
- 22 July 2015
- Published by Springer Nature
- p. 671-679
On Algorithmic Discovery and Computational Implementation of the Opposing Scripts Forming a Joke
- 6 August 2013
- Published by Springer Nature
- p. 111-124
Focus, Salience, and Priming in Cyber-Physical Intelligence
- 6 August 2013
- Published by Springer Nature
- p. 111-124
Focus, Salience, and Priming in Cyber-Physical Intelligence
- 31 January 2013
- Published by Elsevier in Advanced Engineering Informatics
- Vol. 27 (1) , 1-3
Modeling, extraction, and transformation of semantics in computer aided engineering systems
- 31 January 2013
- Published by Elsevier in Advanced Engineering Informatics
- Vol. 27 (1) , 1-3
Modeling, extraction, and transformation of semantics in computer aided engineering systems
- 1 January 2013
- Published by Springer Nature
- p. 893-900
The Not So Simple Ontology of a “Primitive” Robot
- 1 January 2013
- Published by Springer Nature
- p. 893-900
The Not So Simple Ontology of a “Primitive” Robot
- 1 January 2013
- Published by Elsevier in Advanced Engineering Informatics
- Vol. 27 (1) , 4-12
Meaning- and ontology-based technologies for high-precision language an information-processing computational systems
- 1 January 2013
- Published by Elsevier in Advanced Engineering Informatics
- Vol. 27 (1) , 4-12
Meaning- and ontology-based technologies for high-precision language an information-processing computational systems
- 1 January 2012
- Published by SAGE Publications in Journal of Integrated Design and Process Science
- Vol. 16 (3) , 133-148
On the Transdisciplinary Field of Humor Research
Based on formal theories of humor and a computational semantic technology for information and text meaning analysis, computers could be programmed to detect and generate humor and determine the patterns of individual humor preferences both for the jo
- 1 January 2012
- Published by SAGE Publications in Journal of Integrated Design and Process Science
- Vol. 16 (3) , 133-148
On the Transdisciplinary Field of Humor Research
Based on formal theories of humor and a computational semantic technology for information and text meaning analysis, computers could be programmed to detect and generate humor and determine the patterns of individual humor preferences both for the jo
- 1 January 2009
- Published by Walter de Gruyter GmbH in Journal of Literary Theory
- Vol. 3 (2) , 285-311
How to Understand and Assess a Theory: The Evolution of the SSTH into the GTVH and Now into the OSTH
The main thrust of this paper is to present to an important adjacent scholarly community of literary scholars how humor can be treated by the current strand of contemporary linguistics, or – more specifically – by linguistic semantics. In the process, we will show how a major theory of humor, the Semantic Script-based Theory of Humor (Raskin, Semantic Mechanisms of Humor, 325–335, 1979a, Semantic Mechanisms of Humor, 1985; Attardo, Linguistic Theories of Humor, 1994) first evolved into the General Theory of Verbal Humor (Attardo/Raskin, HUMOR – International Journal of Humor Research 4: 293–347, 1991; Attardo, Linguistic Theories of Humor, 1994), and now into the Ontological Semantic Theory of Humor (Raskin/Triezenberg, Ontological Semantics of Humor: Pre-Conference Tutorial, Youngstown State University, 2005; Raskin, From SSTH to GTVH to OSTH, Finally, University of California, 2009; Hempelmann, From SSTH to GTVH to OSTH: The LM in OSTH, University of California, 2009; Taylor, SO in OSTH: Ontological Semantic View of Script Overlap/Oppositeness Support, University of California, 2009, Journal of Ambient Intelligence and Humanized Computing 1: 3, 2010). The last theory is a work in (rapid) progress, and the last section of the paper will be devoted to a number of recent developments in blending the Ontological Semantic Technology our team is developing for Natural Language Processing applications with the improved and revised humor theory. Before we get there, however, we will discuss three major areas that are necessary for understanding, especially by scholars outside of linguistic semantics, what we have been doing and why. First, we will explain our understanding of theory, so that it not be confused with a reader's own interpretations and expectations and not lead, again and again, to the most surprising readings of what our theory of humor has done. Second, we will restate – for those yet unexposed to either of them – what exactly the Semantic Script-based Theory of Humor and the General Theory of Verbal Humor claim, what premises they use, what their goals are, and how they justify and evaluate themselves. In the last section of the paper on the Ontological Semantic Theory of Humor we will address a number of important issues, often subverting and revising the claims of its predecessors. The Semantic Script-based Theory of Humor claimed that the list of script oppositions was an extra piece of knowledge that it had to use along with regular semantic analysis, this making the Semantic Script-based Theory of Humor no longer a strict application of linguistic semantics to humor. We will demonstrate how the list actually folds onto Ontological Semantic Theory, so this disappears as an obstacle to the strict-application status of the Ontological Semantic Theory of Humor. Second, we will show that Ontological Semantic Theory offers a procedure for discovering the main script opposition in a joke, an algorithm that the Semantic Script-based Theory of Humor and General Theory of Verbal Humor described rather rigorously for a competent linguist, but apparently incomprehensibly to other, often enthusiastic adherents of the theories. We will also sketch out the contribution Ontological Semantic Theory can make to the still controversial Logical Mechanism Knowledge Resource of the General Theory of Verbal Humor. This will be an initial step, we hope, towards understanding how jokes are put together and what exactly their internal/false logics are. One side product of this paper is intended to be a better understanding by the non-linguists and atheoretical linguists in the humor research community as well as by any scholar interested in humor, what the linguists of humor do and what they don't, what they can deliver to these communities and what they cannot, and what to expect from our work and what to do on their own rather than writing misdirected, even if majorly entertaining, things about our work. We do not intend this paper to kill off all the Hollywood-strength conspiracy theories, mostly of European vintage, of how a bunch of us have been trying to dominate humor research and claim the firstborns from everybody else. We do apologize for trying to remove the fun stuff from humor research: we realize we are acting as killjoys and killsports; instead of joining the fun and games of discovering the subverting humanity and inexhaustible complexity of humor, we boringly persist in discovering the truth about how humor works.
- 1 January 2009
- Published by Walter de Gruyter GmbH in Journal of Literary Theory
- Vol. 3 (2) , 285-311
How to Understand and Assess a Theory: The Evolution of the SSTH into the GTVH and Now into the OSTH
The main thrust of this paper is to present to an important adjacent scholarly community of literary scholars how humor can be treated by the current strand of contemporary linguistics, or – more specifically – by linguistic semantics. In the process, we will show how a major theory of humor, the Semantic Script-based Theory of Humor (Raskin, Semantic Mechanisms of Humor, 325–335, 1979a, Semantic Mechanisms of Humor, 1985; Attardo, Linguistic Theories of Humor, 1994) first evolved into the General Theory of Verbal Humor (Attardo/Raskin, HUMOR – International Journal of Humor Research 4: 293–347, 1991; Attardo, Linguistic Theories of Humor, 1994), and now into the Ontological Semantic Theory of Humor (Raskin/Triezenberg, Ontological Semantics of Humor: Pre-Conference Tutorial, Youngstown State University, 2005; Raskin, From SSTH to GTVH to OSTH, Finally, University of California, 2009; Hempelmann, From SSTH to GTVH to OSTH: The LM in OSTH, University of California, 2009; Taylor, SO in OSTH: Ontological Semantic View of Script Overlap/Oppositeness Support, University of California, 2009, Journal of Ambient Intelligence and Humanized Computing 1: 3, 2010). The last theory is a work in (rapid) progress, and the last section of the paper will be devoted to a number of recent developments in blending the Ontological Semantic Technology our team is developing for Natural Language Processing applications with the improved and revised humor theory. Before we get there, however, we will discuss three major areas that are necessary for understanding, especially by scholars outside of linguistic semantics, what we have been doing and why. First, we will explain our understanding of theory, so that it not be confused with a reader's own interpretations and expectations and not lead, again and again, to the most surprising readings of what our theory of humor has done. Second, we will restate – for those yet unexposed to either of them – what exactly the Semantic Script-based Theory of Humor and the General Theory of Verbal Humor claim, what premises they use, what their goals are, and how they justify and evaluate themselves. In the last section of the paper on the Ontological Semantic Theory of Humor we will address a number of important issues, often subverting and revising the claims of its predecessors. The Semantic Script-based Theory of Humor claimed that the list of script oppositions was an extra piece of knowledge that it had to use along with regular semantic analysis, this making the Semantic Script-based Theory of Humor no longer a strict application of linguistic semantics to humor. We will demonstrate how the list actually folds onto Ontological Semantic Theory, so this disappears as an obstacle to the strict-application status of the Ontological Semantic Theory of Humor. Second, we will show that Ontological Semantic Theory offers a procedure for discovering the main script opposition in a joke, an algorithm that the Semantic Script-based Theory of Humor and General Theory of Verbal Humor described rather rigorously for a competent linguist, but apparently incomprehensibly to other, often enthusiastic adherents of the theories. We will also sketch out the contribution Ontological Semantic Theory can make to the still controversial Logical Mechanism Knowledge Resource of the General Theory of Verbal Humor. This will be an initial step, we hope, towards understanding how jokes are put together and what exactly their internal/false logics are. One side product of this paper is intended to be a better understanding by the non-linguists and atheoretical linguists in the humor research community as well as by any scholar interested in humor, what the linguists of humor do and what they don't, what they can deliver to these communities and what they cannot, and what to expect from our work and what to do on their own rather than writing misdirected, even if majorly entertaining, things about our work. We do not intend this paper to kill off all the Hollywood-strength conspiracy theories, mostly of European vintage, of how a bunch of us have been trying to dominate humor research and claim the firstborns from everybody else. We do apologize for trying to remove the fun stuff from humor research: we realize we are acting as killjoys and killsports; instead of joining the fun and games of discovering the subverting humanity and inexhaustible complexity of humor, we boringly persist in discovering the truth about how humor works.
- 14 February 2008
- Published by Wiley in Journal of Computing and Information Science in Engineering
- Vol. 8 (1) , 011003
Developing Engineering Ontology for Information Retrieval
When engineering content is created and applied during the product life cycle, it is often stored and forgotten. Since search remains word based, engineers do not have the effective means to harness and reuse past designs and experiences. Current information retrieval approaches based on statistical methods and keyword matching do not satisfy users’ needs in the engineering domain. Therefore, we propose a new computational framework that includes an ontological basis and algorithms to retrieve unstructured engineering documents while handling complex queries. The results from the preliminary test demonstrate that our method outperforms the traditional keyword-based search with respect to the standard information retrieval measurement.
- 14 February 2008
- Published by Wiley in Journal of Computing and Information Science in Engineering
- Vol. 8 (1) , 011003
Developing Engineering Ontology for Information Retrieval
When engineering content is created and applied during the product life cycle, it is often stored and forgotten. Since search remains word based, engineers do not have the effective means to harness and reuse past designs and experiences. Current information retrieval approaches based on statistical methods and keyword matching do not satisfy users’ needs in the engineering domain. Therefore, we propose a new computational framework that includes an ontological basis and algorithms to retrieve unstructured engineering documents while handling complex queries. The results from the preliminary test demonstrate that our method outperforms the traditional keyword-based search with respect to the standard information retrieval measurement.