49
Computational Approaches to Conceptual Blending Amílcar Cardoso Autumn School on Computational Creativity Porvoo, Finland, November

Computational Approaches to Conceptual Blending

Embed Size (px)

DESCRIPTION

Slides of the lectures in the Autumn School on Computational Creativity, Porvoo, Finland, November 2013 Organized by PROSECCO project.

Citation preview

Page 1: Computational Approaches to Conceptual Blending

Computational Approaches to Conceptual BlendingAmílcar CardosoAutumn School on Computational CreativityPorvoo, Finland, November !"#$

Page 2: Computational Approaches to Conceptual Blending

Part I - Conceptual BlendingPart II - Divago

!

Page 3: Computational Approaches to Conceptual Blending

Conceptual Blending

n Fauconnier and Turner [#%%&, !""!, !""$]

n “Basic mental operation that leads to new meaning, global insight, and conceptual compressions useful for memory and manipulation of otherwise diffuse ranges of meaning”.

n Blend: a concept (or web of concepts) whose existence and identity, although attached to the pieces of knowledge that participated in its generation (the inputs), acquires gradual independence through use.

n Ex: Pegasus, Pokemon, Computer Desktop

$

Page 4: Computational Approaches to Conceptual Blending

Conceptual Blending

n Fauconnier and Turner [#%%&, !""!, !""$]

n “Basic mental operation that leads to new meaning, global insight, and conceptual compressions useful for memory and manipulation of otherwise diffuse ranges of meaning”.

n “Plays a fundamental role in the construction of meaning in everyday life”

'

Page 5: Computational Approaches to Conceptual Blending

(

pattern completion

elaboration

Page 6: Computational Approaches to Conceptual Blending

Conceptual Blending

n Not a creative mechanism in itself...

n ... but the framework models cognitive processes involved in creativity

n ... thus it may be worth to explore it for computational creativity

)

Page 7: Computational Approaches to Conceptual Blending

*

Riddle of the Buddhist Monk [Koestler, !"#$)

n A Buddhist Monk begins at dawn one day walking up a mountain, reaches the top at sunset, meditates at the top for several days until one dawn when he begins to walk back to the foot of the mountain, which he reaches at sunset. Make no assumptions about his starting or stopping or about his pace during the trips.

n Riddle: Is there a place on the path that the monk occupies at the same hour of the day on the two separate journeys?

Page 8: Computational Approaches to Conceptual Blending

&

Input Mental Spaces

Input Space !(time t = d!)

Input Space %(time t = d%)

Page 9: Computational Approaches to Conceptual Blending

%

Input Mental Spaces

Cross-Space Mapping

Page 10: Computational Approaches to Conceptual Blending

#"

Generic Space

Page 11: Computational Approaches to Conceptual Blending

##

Generic Space

Input Space !(time t = d!)

Input Space %(time t = d%)

Blended Space(time t = t’)

Page 12: Computational Approaches to Conceptual Blending

Mental spaces

n “Small conceptual packets constructed as we think and talk, for purposes of local understanding and action” [F&T]

n “They are interconnected, and can be modified as thought and discourse unfold” (idem)

n “can be used generally to model dynamic mappings in thought and language” (idem)

#!

Page 13: Computational Approaches to Conceptual Blending

Mental spaces

#$

computer

produce

receive

representationcontain

processescollection

program

computer

input

binary

output

instruction

Page 14: Computational Approaches to Conceptual Blending

Mental spaces

#'

ride

pwpw

pw

purpose

ability

sound

qty

pwqty

pw

ppty

purpose qty

horse

hoof

snout

neigh

mane

4

runleg

cargo

eye

human

see

long

2horse

computer

produce

receive

representationcontain

processescollection

program

computer

input

binary

output

instruction

Page 15: Computational Approaches to Conceptual Blending

Mental spaces

#(

pw

ride

pwpw

pw

purpose

ability

sound

qty

pwqty

bird

wing

beak

chirp

2

runfly

pet

human

bird

computer

produce

receive

representationcontain

processescollection

program

computer

input

binary

output

instruction

ride

pwpw

pw

purpose

ability

sound

qty

pwqty

pw

ppty

purpose qty

horse

hoof

snout

neigh

mane

4

runleg

cargo

eye

human

see

long

2horse

Page 16: Computational Approaches to Conceptual Blending

Mental spaces

#)

belong_to

evaluative_quality

ability

invadesinfects

reduced

hostvirus

unwanted

replicates

resourcescapacityuse

virus

computer

produce

receive

representationcontain

processescollection

program

computer

input

binary

output

instruction

ride

pwpw

pw

purpose

ability

sound

qty

pwqty

pw

ppty

purpose qty

horse

hoof

snout

neigh

mane

4

runleg

cargo

eye

human

see

long

2horse

pw

ride

pwpw

pw

purpose

ability

sound

qty

pwqty

bird

wing

beak

chirp

2

runfly

pet

human

bird

Page 17: Computational Approaches to Conceptual Blending

#*

Boat race

n Two input spaces: clipper in #&($, catamaran in #%%$

n Generic space: sailing from S. Francisco to Boston

n Blend: single event, two boats, #%%$n pattern completion: “race” frame imported from backgroundn elaboration: we imagine relative positions and dynamics

Page 18: Computational Approaches to Conceptual Blending

#&

Boat race

n Blend: single event, two boats, #%%$n pattern completion: “race” frame imported from backgroundn elaboration: we imagine relative positions and dynamics

n The blended space remains connected to the inputs by the mappings:n the catamaran is going faster than the clipper, and how much

Page 19: Computational Approaches to Conceptual Blending

Cross-space Mappings

n Process: identity, structure alignment, slot-filling, analogy, ...

#%

computer

produce

receive

representationcontain

processescollection

program

computer

input

binary

output

instructionbelong_to

evaluative_quality

ability

invadesinfects

reduced

hostvirus

unwanted

replicates

resourcescapacityuse

virus

Page 20: Computational Approaches to Conceptual Blending

!"computer

produce

receive

representationcontain

processescollection

program

computer

input

binary

output

instructionbelong_to

evaluative_quality

ability

invadesinfects

reduced

hostvirus

unwanted

replicates

resourcescapacityuse

virus

representationcontain

belong_to

evaluative_quality

ability

invadesinfects

reduced

computer computer virus

unwanted

replicates

resources

capacityuse

collectioninstruction

processes

binary

Computer Virus

Page 21: Computational Approaches to Conceptual Blending

Principles

n Constitutive principles: n Partial cross-space mappings, selective projection, completion, elaboration

n Governing principles:n strategies for optimising emergent structuren competing pressuresn & principles in original theory, later on distilled to '

!#

Page 22: Computational Approaches to Conceptual Blending

Governing Principles

n Topology:n Other things being equal, set up the blend and the inputs so that useful

topology in the inputs and their outer-space relations is reflected by inner-space relations in the blend.

n Unpacking:n Other things being equal, the blend all by itself should prompt for the

reconstruction of the entire network.

!!

Page 23: Computational Approaches to Conceptual Blending

Governing Principles

n Web:n Other things being equal, manipulating the blend as a unit must maintain

the web of appropriate connections to the input spaces easily and without additional surveillance or computation.

n Integration:n achieve an integrated blend.

!$

Page 24: Computational Approaches to Conceptual Blending

Integration networks

n Four main types of integration networks:n Simplex: one input consists of a frame and the other consists of specific

elements.n Mirror: a common organising frame is shared by all spaces in the networkn Single-Scope: the organising frames of the inputs are different, and the

blend inherits only one of those frames.n Double-Scope: essential frame and identity properties are brought in from

both inputs (Frame Blending)

!'

Page 25: Computational Approaches to Conceptual Blending

Integration networks

n Four main types of integration networks:n Simplex: one input consists of a frame and the other consists of specific

elements.n example: “James is the father of John”

n Mirror: a common organising frame is shared by all spaces in the networkn Buddhist Monk, Regatta

!(

Page 26: Computational Approaches to Conceptual Blending

Integration networks

n Examples:n Single-Scope: the organising frames of the inputs are different, and the

blend inherits only one of those frames.n “Presidential shoot-out”

n Double-Scope: essential frame and identity properties are brought in from both inputs (Frame Blending)n “The president is snatching the rice bowl out of the child's hands”n Two frames: one for "snatching", another for “political decision”

!)

Page 27: Computational Approaches to Conceptual Blending

Part I - Conceptual BlendingPart II - Divago

!*

Page 28: Computational Approaches to Conceptual Blending

!&

Divago

n Given:n Two input Domains (Mental Spaces)n One Generic Space Domain

n Produces:n Blend Domain

Generic Space

Input 1 Input 2

Blend

Page 29: Computational Approaches to Conceptual Blending

Divago Architecture

!%

Knowledge Base

Elaboration

Con

stra

ints

Goal

Factory

Map

per

Blen

der

Page 30: Computational Approaches to Conceptual Blending

Knowledge Base

n Composed by Domains

n Domain:n Concept Mapn set of Instancesn set of Rulesn set of Frames n set of Integrity Constraints

$"

Knowledge Base

Elaboration

Con

stra

ints

Goal

Factory

Map

per

Blen

der

Page 31: Computational Approaches to Conceptual Blending

Knowledge Base

n Composed by Domains

n Domain:n Concept Mapn set of Instancesn set of Rulesn set of Frames n set of Integrity Constraints

$#

pptyqty

purpose

ride

pw

pw

pw

purpose

ability

sound

qty

pwqty

pw

horse

hoof

snout

neigh

mane

4

runleg

cargo

eye

human

see

long

2horse

pw

ride

pw

pw

pw

purpose

ability

soundqty

pw qtybird

wing

beak

chirp

2

runfly

pet

human

bird

Page 32: Computational Approaches to Conceptual Blending

Knowledge Base

n Composed by Domains

n Domain:n Concept Mapn set of Instancesn set of Rulesn set of Frames n set of Integrity Constraints

$!

Page 33: Computational Approaches to Conceptual Blending

Knowledge Base

n Composed by Domains

n Domain:n Concept Mapn set of Instancesn set of Rulesn set of Frames n set of Integrity Constraints

$$

Transforming Frame

Page 34: Computational Approaches to Conceptual Blending

Knowledge Base

n Composed by Domains

n Domain:n Concept Mapn set of Instancesn set of Rulesn set of Frames n set of Integrity Constraints

$'

Page 35: Computational Approaches to Conceptual Blending

Mapping Engine

$(

Knowledge Base

Elaboration

Con

stra

ints

Goal

Factory

Map

per

Blen

der

Page 36: Computational Approaches to Conceptual Blending

Mapping Engine

n Structure alignment + Spreading activationn Similar to Sapper [Veale %$], but simpler

n Mapping: largest isomorphic pair of subgraphs

n Returns set of all possible mappings

$)

ride

pwhorse

hoof

human

pw

bird

wing

Input 1 (horse)

Input 2(bird)

Page 37: Computational Approaches to Conceptual Blending

Blender

n For each mapping m, makes a blending projection

$*

ride

pwhorse

hoof

human

pw

bird

wing

Input 1 (horse)

Input 2(bird)

nil

nil

nil

horse | bird

wing | hoof

human

horse

bird

wing

hoofBlend

Page 38: Computational Approaches to Conceptual Blending

Blender

n For each mapping m, makes a blending projection

n Then, projects remaining elements in the Blend

$&

ride

pwhorse

hoof

human

pw

bird

wing

Input 1 (horse)

Input 2(bird)

horse | bird

wing | hoof

human

horse

wing

hoof

bird

BlendoidBlend

Page 39: Computational Approaches to Conceptual Blending

Factory

$%

Knowledge Base

Elaboration

Con

stra

ints

Goal

Factory

Map

per

Blen

der

Page 40: Computational Approaches to Conceptual Blending

Factory

n Explores the space of all possible combinations of projections

n Divergent Strategy: GA

n Convergent Strategy

n Stoping condition

'"

Knowledge Base

Elaboration

Con

stra

ints

Goal

Factory

Map

per

Blen

der

Page 41: Computational Approaches to Conceptual Blending

Factory

n Evolve projections:n individual = set of projections for each node of input domainsn Paralell search for best blend

n Compute Blend:n for each individual

n Fitness function:n weighted sum of optimality constraints

n & optimality principles (from F&T !""!)

'#

Page 42: Computational Approaches to Conceptual Blending

Optimality Constraints (F&T %&&%)

n Integration

n Topology

n Maximization of Vital Relations

n Unpacking

n Relevance

n Web

n Pattern Completion

n Intensification of Vital Relations

'!

Page 43: Computational Approaches to Conceptual Blending

Elaboration

n Completion + Elaboration

n Run Frames, run rules

'$

Page 44: Computational Approaches to Conceptual Blending

Boat-House experiment

n Only Concept Maps + Instances

''

Page 45: Computational Approaches to Conceptual Blending

Boat-House experiment

'(

Page 46: Computational Approaches to Conceptual Blending

Creatures experiment

n Input creatures

')

Page 47: Computational Approaches to Conceptual Blending

Creatures experiment - outputs

n horse|dragon (nov=".!(), horse|werewolf (".()) and werewolf|dragon (".)!)

'*

Page 48: Computational Approaches to Conceptual Blending

Creatures experiment - outputs

n horse|dragon (".$*), horse|werewolf (".&)) and werewolf|dragon (".)()

'&

Page 49: Computational Approaches to Conceptual Blending

Recent approaches

n Li, B., Zook, A., Davis, N., and Riedl, M. (!"#!). Goal-Driven Conceptual Blending: A Computational Approach for Creativity (ICCC#!)n address the efficiency issues by constructing blends in a goal-driven and

context-driven manner.

n Veale, T. (!"#!). From Conceptual “Mash-ups” to “Bad-ass” Blends: A Robust Computational Model of Conceptual Blending. (ICCC#!)n constrained notion of Blend for creative reuse and extend existing

common-sense knowledge of a topic

'%