Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Graeme Ritchie

dblp:03/1863 · DBLP profile ↗
← Back
13ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 10Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Generative modeling · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › computational creativity
computational humor
0.011994
An Implemented Model of Punning Riddles · AAAI 1994
YearPublicationVenuePosition
2012 A closer look at creativity as search
Graeme Ritchie
ICCC1
2012 Using genetic algorithms to create meaningful poetic text
abstract
This article presents a series of experiments in automatically generating poetic texts. We confined our attention to the generation of texts which are syntactically well-formed, meet certain pre-specified patterns of metre and broadly convey some given meaning. Such aspects can be formally defined, thus avoiding the complications of imagery and interpretation that are central to assessing more free forms of verse. Our implemented system, McGONAGALL, applies the genetic algorithm to construct such texts. It uses a sophisticated linguistic formalism to represent its genomic information, from which can be computed the phenotypic information of both semantic representations and patterns of stress. The conducted experiments broadly indicated that relatively meaningful text could be produced if the constraints on metre were relaxed, and precise metric text was possible with loose semantic constraints, but it was difficult to produce text which was both semantically coherent and of high quality metrically.
Ruli Manurung, Graeme Ritchie, Henry Thompson
J. Exp. Theor. Artif. Intell.2
2010 Quantifying Humorous Lexical Incongruity
Chris Venour, Graeme Ritchie, Chris Mellish
ICCC2
2008 Generation of Referring Expressions: Managing Structural Ambiguities
Imtiaz Hussain Khan, Kees van Deemter, Graeme Ritchie
COLING3
2008 An Implementation of a Flexible Author-Reviewer Model of Generation using Genetic Algorithms
Ruli Manurung, Graeme Ritchie, Henry Thompson
PACLIC2
2008 References to graphical objects in interactive multimodal queries
Daqing He, Graeme Ritchie, John Lee 0004
Knowl. Based Syst.2
2006 The Clarity-Brevity Trade-off in Generating Referring Expressions
Imtiaz Hussain Khan, Graeme Ritchie, Kees van Deemter
INLG2
2006 Building a Lexical Database for an Interactive Joke-Generator
Ruli Manurung, David A. O'Mara, Helen Pain, Graeme Ritchie, Annalu Waller
LREC4
2000 Resolving References to Graphical Objects in Multimodal Queries by Constraint Satisfaction
Daqing He, Graeme Ritchie, John Lee 0004
ICMI2
1998 A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems
Jonathan Lewis, Emma Hart, Graeme Ritchie
PPSN3
1996 Approximate Generation from Non-Hierarchical Representations
abstract
This paper presents a technique for sentence generation.We argue that the input to generators should have a non-hierarchical nature.This allows us to investigate a more general version of the sentence generation problem where one is not pre-committed to a choice of the syntactically prominent elements in the initial semantics.We also consider that a generator can happen to convey more (or less) information than is originally specified in its semantic input.In order to constrain this approximate matching of the input we impose additional restrictions on the semantics of the generated sentence.Our technique provides flexibility to address cases where the entire input cannot be precisely expressed in a single sentence.Thus the generator does not rely on the strategic component having linguistic knowledge.We show clearly how the semantic structure is declaratively related to linguistically motivated syntactic representation.
Nicolas Nicolov, Chris Mellish, Graeme Ritchie
INLG (1)3
1996 Obtaining Multiple Distinct Solutions with Genetic Algorithm Niching Methods
Alasdair Turner, David W. Corne, Graeme Ritchie, Peter Ross
PPSN3
1994 An Implemented Model of Punning Riddles
Kim Binsted, Graeme Ritchie
AAAI2