Professional Documents
Culture Documents
Part Six: Formal Neurosemantics: Neurolinguistics
Part Six: Formal Neurosemantics: Neurolinguistics
lambdas
part six:
Formal Neurosemantics
logic, meaning and composition in the brain
Plato
Aristotle
Montague
Formal Neurosemantics
Panizza, 2011
LANGUAGE
a code exploited by humans in order to communicate in a very fast and efficient way
linguistic tokens
(words)
syntactic
rules
meaning of
each word
(lexicon)
Formal Neurosemantics
linguistic tokens
(words)
Panizza, 2011
syntactic
rules
meaning of
each word
(lexicon)
Formal Neurosemantics
linguistic tokens
(words)
syntactic
rules
meaning of
each word
(lexicon)
Panizza, 2011
abstract
not tied to specific entity or sensorial modality
symbolic
manipulated through logical (mathematical, formal)
operations
Formal Neurosemantics
Panizza, 2011
Alfred Tarski
how we use it
Formal Neurosemantics
Donald Davidson
Panizza, 2011
Formal Neurosemantics
Panizza, 2011
how can we capture the meaning of there is, some, who and a?
mapping between natural language and formal language: syntax + formal semantics
some
D. Panizza
Journal of Neurolinguistics
introduces
the/ existence
of entities xxx (2010) 129
logical formFormula
= explicit(4)
representation
of conditions
under
which
a sentence
is true
states that (3)
is true if and
only
if there
is an individual
x wh
where
entities
arey.made
formallyas
explicit
individual
y logical
that isrelationships
a sandwichbetween
such that
x eats
Therefore,
soon as o
ere
Formal Neurosemantics
Panizza, 2011
D. Panizza
/ Journal of Neurolinguistics xxx (2010) 129
there is some kid who is eating
a sandwich
Formula (4) states that (3) is true if and only if there is an individual x who is a kid, an
individual y that is a sandwich such that x eats y. Therefore, as soon as our model pr
it isstanding
true if and
only
if there
is an individual
x
in an
eating
relation
with a sandwich,
(3) is true.
who isToa kid
there
is an
y that
get and
some
grasp
forindividual
the power
of this method, let us consider slightly more comp
is aincluding
sandwichphrasal
such asconnectives.
x eats y
(5)
(6)
First, to know under which conditions sentences such as (5) and (6) are true, we n
implement(10a)
the meaning
of the connectives
or and
in our formal
language.
What does(10
thi
sentence
is evaluated;
b) sets
ofand
situations
where
sentence
semantics is the truth functions, which takes truth values as input, and yields a truth value
may rely on rst-order predicate logic and assign to and and or the truth tables of logical co
Formula (4) states that (3) is true if and only if there is an individual x who is a kid, and there is an
individual
individual yy that
that isis aa sandwich
sandwich such
such that
thatxxeats
eatsy.y.Therefore,
Therefore,as
assoon
soonasasour
ourmodel
modelprovides
providesa aboy
boy
standing
in
eating
Formal
standing
in an
anNeurosemantics
eatingrelation
relationwith
withaasandwich,
sandwich,(3)
(3)isistrue.
true.
Panizza,more
2011
To get some grasp for the power of this method, let us consider slightly
complex sentences
To get some grasp for the power of this method, let us consider slightly more complex sentences
including phrasal connectives.
including phrasal connectives.
logical
entailment
First, to know under which conditions sentences such as (5) and (6) are true, we need a way to
First, tothe
know
underofwhich
conditions
sentences
such
as (5)language.
and (6) What
are true,
we
need
aformal
way to
implement
meaning
the
connectives
or
and
and
in
our
formal
does
this
job
in
we need
ameaning
way to of
implement
the meaning
of
implement
the
the
connectives
or
and
and
in our
formaland
language.
this
in formal
semantics is the truth functions, which takes truth values
as input,
yields aWhat
truthdoes
value
as job
output.
We
or andisand
ourfunctions,
formal language
semantics
the in
truth
takes
truth
asor
input,
and yields
value
as output.
We
may
rely on rst-order
predicate which
logic and
assign
tovalues
and and
the truth
tables aoftruth
logical
conjunction
and
may rely on respectively,
rst-order predicate
andbeing
assign
to and
and
the
truth tables
logical
conjunction
and
disjunction,
with thelogic
former
true
when
allor
the
conjuncts
are of
true
and the
latter being
disjunction,
with
the former
being
true
all thetruth
conjuncts
are rst
true part
and of
thetheir
latter
being
truth
functions:
truth
values
true
when
at respectively,
least
one of the
disjuncts
is true.
Now
we when
can compare
(5) to values
(6). The
logical
true when
at least
one is
ofat
the
disjuncts
Now ywe
can
(6). The
rst
their
logical
form
is identical.
There
least
a kid x,isa true.
sandwich
and
ancompare
orange z.(5)
Thetosecond
part
ofpart
(5b)of
says
that
the
form
is identical.
There isand
at least
a kid x, a sandwich
andsays
an orange
Thealso
second
partone
of (5b)
says that
the
kid
eats
both the orange
the sandwich,
whereasy(6b)
that hez.can
eat just
of them.
Thus,
first
order
eats
both
orange
andfrom
the sandwich,
whereas
(6b) says
thatand
he
can
also
one
of them.
Thus,
eating
athe
sandwich
eating
an
orange
or(5b)
and
akid
straight
intuition
coming
the
comparison
between
(6b)
is eat
thatjust
the
former
is more
logicformer is more
a straight than
intuition
coming
from
the comparison
(5b)
and (6b) in
is which
that the
restrictive
the latter.
More
precisely,
(5b) is true between
in a subset
of situations
(6b) is true, hence
T(5b) is true
T eating
Tboth a sandwich
T the latter.
restrictive
than
MoreRoughly
precisely,
in aissubset
of situations
in which (6b)
is true,
hence
the
former is
logically
stronger.
speaking,
if there
a boy
and an
orange,
it
the former
is logically
stronger.
Roughly
speaking,
ifthem.
there This
is aTboy
eating
both a sandwich
and
an orange,
it
plainly
follows
that
there
is
also
a
boy
eating
one
of
meaning
relation
that
holds
between
(6a)
F
F
T
plainly
follows
that
there
is
also
a
boy
eating
one ofanother
them. This
meaningBrelation
thatofholds
between- i.e.
(6a)
and (5a) is called entailment. A proposition A entails
proposition
if the truth
A implicates
TbetweenF(5a)
and (5a)entails
is called
entailment.
AMost
proposition
B if
the(6a)
truth
of Aany
implicates
- i.e.
T - the
FA entails
ensures,
truth of B.
importantly,
thisanother
relationproposition
and
- like
other types
ensures,
- the truth
of B. sentences
Most importantly,
this relation
between
(5a)in
and
(6a) -they
like are
anyevaluated.
other types
of
formalentails
relationships
among
- holds regardless
of
the context
which
F
F
F
F- holds regardless of the context in which they are evaluated.
of formal
relationships
among between
sentences(5a)
Namely,
the
entailment relation
and (6a) is due to the (logical) meaning of the connectives or
Namely,
entailment
(5a)inand
(6a)this
is due
to the (logical)
meaning
of the connectives or
and
and, the
rather
than on relation
the kindbetween
of scenario
which
sentence
is uttered
and veried.
Formula (4) states that (3) is true if and only if there is an individual x who is a kid, and there is an
individual
individual yy that
that isis aa sandwich
sandwich such
such that
thatxxeats
eatsy.y.Therefore,
Therefore,as
assoon
soonasasour
ourmodel
modelprovides
providesa aboy
boy
standing
in
eating
Formal
standing
in an
anNeurosemantics
eatingrelation
relationwith
withaasandwich,
sandwich,(3)
(3)isistrue.
true.
Panizza,more
2011
To get some grasp for the power of this method, let us consider slightly
complex sentences
To get some grasp for the power of this method, let us consider slightly more complex sentences
including phrasal connectives.
including phrasal connectives.
logical
entailment
First, to know under which conditions sentences such as (5) and (6) are true, we need a way to
First, to know under which conditions sentences such as (5) and (6) are true, we need a way to
implement the meaning of the connectives or and and in our formal language. What does this job in formal
implement
meaning
of in
theevery
connectives
and and
in which
our
formal
language.
does
this
in formal
sentence
is true
circumstance
in
sentence
(b)aWhat
is true
semantics
isthe
the(a)
truth
functions,
which
takesortruth
values
as input,
and
yields
truth
value
as job
output.
We
semantics
the truth functions,
takes
truth
asor
input,
and yields
value
as output.
We
may
rely onisrst-order
predicate which
logic and
assign
tovalues
and and
the truth
tables aoftruth
logical
conjunction
and
does
not hold:
(a)and
can
betrue
true
with
(b)
being
false
maythe
relyconverse
on respectively,
rst-order
predicate
assign
to and
and
the
truth
tables
logical
conjunction
and
disjunction,
with thelogic
former
being
when
allor
the
conjuncts
are of
true
and the
latter being
disjunction,
with
the former
being
true
all the conjuncts
are rst
true part
and of
thetheir
latter
being
true
when at respectively,
least one of the
disjuncts
is true.
Now
we when
can compare
(5) to (6). The
logical
logical entailment
true when
at least
one is
ofat
the
disjuncts
Now ywe
can
(6). The
rst
their
logical
form
is identical.
There
least
a kid x,isa true.
sandwich
and
ancompare
orange z.(5)
Thetosecond
part
ofpart
(5b)of
says
that
the
form
is identical.
There isand
at least
a kid x, a sandwich
andsays
an orange
Thealso
second
partone
of (5b)
says that
the
kid
eats
both the orange
the sandwich,
whereasy(6b)
that hez.can
eat just
of them.
Thus,
eats
both
orange
andfrom
the sandwich,
whereas
(6b) says
thatand
he
can
also
of them.
Thus,
eating
athe
sandwich
eating
an
orange
or(5b)
and
akid
straight
intuition
coming
the
comparison
between
(6b)
is eat
thatjust
theone
former
is more
a straight than
intuition
coming
from
the comparison
(5b)
and (6b) in
is which
that the
more
restrictive
the latter.
More
precisely,
(5b) is true between
in a subset
of situations
(6b)former
is true,is
hence
T(5b) is true
T eating
Tboth a sandwich
T the latter.
restrictive
than
MoreRoughly
precisely,
in aissubset
of situations
in which (6b)
is true,
hence
the
former is
logically
stronger.
speaking,
if there
a boy
and an
orange,
it
the former
is logically
stronger.
Roughly
speaking,
ifthem.
there This
is aTboy
eating
both a sandwich
and
an orange,
it
plainly
follows
that
there
is
also
a
boy
eating
one
of
meaning
relation
that
holds
between
(6a)
F
F
T
plainly
follows
that
there
is
also
a
boy
eating
one ofanother
them. This
meaningBrelation
thatofholds
between- i.e.
(6a)
and (5a) is called entailment. A proposition A entails
proposition
if the truth
A implicates
TbetweenF(5a)
and (5a)entails
is called
entailment.
AMost
proposition
B if
the(6a)
truth
of Aany
implicates
- i.e.
T - the
FA entails
ensures,
truth of B.
importantly,
thisanother
relationproposition
and
- like
other types
ensures,
- the truth
of B. sentences
Most importantly,
this relation
between
(5a)in
and
(6a) -they
like are
anyevaluated.
other types
of
formalentails
relationships
among
- holds regardless
of
the context
which
F
F
F
F- holds regardless of the context in which they are evaluated.
of formal
relationships
among between
sentences(5a)
Namely,
the
entailment relation
and (6a) is due to the (logical) meaning of the connectives or
Namely,
entailment
(5a)inand
(6a)this
is due
to the (logical)
meaning
of the connectives or
and
and, the
rather
than on relation
the kindbetween
of scenario
which
sentence
is uttered
and veried.
Formal Neurosemantics
Panizza, 2011
formal semantics
syntactic analysis of the sentence
set of conversion rules that translate the linguistic input into a symbolic
structure (Logical Form)
where the formal relations (e.g. dependency, scope relations, argument
structure, agreement etc.) between the expressions are made explicit
formal language
(e.g. our toy
language)
vocabulary
basic expressions
syntax
set of rules of conversion
Formal Neurosemantics
formal language
(e.g. our toy
language)
Panizza, 2011
vocabulary
basic expressions
syntax
set of rules of conversion
Montagues
contention
problems
discrepancy between
natural languages and
formal ones
Formal Neurosemantics
the question is:
Panizza, 2011
3 levels of computation
1) COMPUTATIONAL LEVEL
2) ALGORITHMIC LEVEL
3) IMPLEMENTATION LEVEL
Formal Neurosemantics
1) COMPUTATIONAL LEVEL
Panizza, 2011
what the system does and why
2) ALGORITHMIC LEVEL
formal model: simplification, coded into a symbolic format, of a real word context or situation
abstract, symbolic and grammar-driven representations
logical operators (,,,), variables (x, y, z), set-theoretic operations (,,,)
predicates (boy(x)), higher-order logic systems ( , )
3) IMPLEMENTATION LEVEL
Formal Neurosemantics
back in the 80s
modules:
Panizza, 2011
informationally encapsulated
one module did not access the
representations of another module
phonology
processing:
morpho-syntax
semantics
pragmatics
strictly serial
the output of one module was passed as input to the next module
no jumps, no feedback, no parallel processing (modules had to wait!)
Formal Neurosemantics
in the 2000s
Panizza, 2011
multimodal
areas
rise of distributed networks
732 M. Garagnani and F. Pulvermuller
B
PM L
x = 70 to 20
4.7
M1 L
A1
PF L
AB
z=0
PB
y=0
3.1
x = 70 to 20
Brocas and Wernickes areas are directly linked with sensorial (auditory), associative (prefrontal) and motor (dorsal 10.1
PFi
and ventral pre-motor cortex and primary motor cortex) through
adjacent and long-distance cortical connections
PM i
M1i
AT
TO
V1
z=0
conceptual grounding
General lexicosemantic
face/mouth word
(lick)
arm/hand word
(pick)
leg/foot word
(kick)
3.1
Formal Neurosemantics
Panizza, 2011
Rauschecker
in the 2000s
mirror neurons
Formal Neurosemantics
embodied language
Panizza, 2011
linguistic meaning is processed by the brain in the very same motor representations
involved in perceiving, controlling and executing motor programs
new cognitive primitive mechanism:
can symbolic
NO!
representation perceptual symbols
still exist?
internal simulation
Formal Neurosemantics
however..
Panizza, 2011
motor
apraxia
recognise know how to use but do
not manage to perform the right
movements
ideational
apraxia
visual agnosia
dont recognize but know
how to use
aphasia
recognize and use but dont know how to say
Formal Neurosemantics
anyways..
maybe
Panizza, 2011
perceptual symbols
provide a link
with grammar (syntax)
grounded representations
simulate symbolic/formal
behaviour
abstract power
= brain networks
= processing timing
Let us go back to the afrmative sentences in (5a) and (6a) to test whether the algorithms
Formal
Neurosemantics
Panizza, 2011
and (8) work for these cases. Sentence (5a) is usually uttered in the circumstances in whi
speaker does not know for certain whether there is a kid eating a sandwich or an orange. Eith
if it is being eaten by the kid, describes the meaning of this sentence. It seems, thus, that the
productive system based on perceptual simulation
Barsalous
perceptual symbols:
rithm in (7) would work perfectly for (5a). In both cases the actual scenario would mat
simulated frame, which alternates the two sub-events where a boy is eating either a sandwich
orange. As for the conjunctive proposition in (6a), here the speaker knows that a boy is eating b
1. construct an internal representation of the proposition via perceptual simulation
orange and a sandwich. Therefore this is the only situation satisfying the meaning of the conju
The 2a.
algorithm
we
sketched
out
in (8) would
work forthe
this
case,under
as conjoining
the two kinds o
simulate
two
separate
sub-events
alternating
entity
disjunction
OR ():
being
eaten
by some
would
exactly match the scenario described by (6a). We have demons
while
holding
theboy
frame
constant
so far, that algorithms such those in (7) and (8) may account for the meaning of logical fu
ANDgrounding
(): 2b. simulate
one frame
containing
both
on simple
operations
applied
to events
perceptual symbols such as alternating or conjo
sub-events.
positive
The
next whether
step of this
argument
is to matches/mismatches
show that the algorithms
in (7) and
(8) run into s
vs.
3. verify
the actual
scenario
the simulated
frame
negation
problems in cases where connectives such as and and or interact with other logical functors, s
negation. Let us consider sentences (9a) and (10a), which are identical to (5a) and (6a) wi
exception of the presence of a negative quantier (no, which means there is no individual) ap
sentence in which disjunction is embedded under negation
to boys.
(reverts the truth condition)
(9)
Barsalous algorithm predicts that a situation with boys eating both sandwich and
(10) a No boys are eating a sandwich and an orange.
oranges would be true!
b :dxdydz [kid(x) ^ sandwich(y) ^ orange(z) ^ (eat (x,y) ^ eat (x,z))]
Sentence (9a), under its more natural interpretation2, means that there is no boy eating a san
if it is being eaten by the kid, describes the meaning of this sentence. It seems, thus, that t
rithm Neurosemantics
in (7) would work perfectly for (5a). In both cases the actual scenario would ma
Formal
Panizza,
simulated frame, which alternates the two sub-events where
a boy2011
is eating either a sandwi
orange. As for the conjunctive proposition in (6a), here the speaker knows that a boy is eating
orange and a sandwich. Therefore this is the only situation satisfying the meaning of the conj
First-order
logic
eating a sandwich
eating an orange
or
not or
The algorithm we sketched out in (8) would work for this case, as conjoining the two kinds
being eaten by some boy would exactly match the scenario described by (6a). We have demon
T
T
T
F
so far, that algorithms such those in (7) and (8) may account for the meaning of logical f
F
T symbols such asT alternating
F
grounding on simple operations
applied to perceptual
or con
sub-events.
T
F
T
F
The next step of this argument is to show that the algorithms in (7) and (8) run into
F
problems in cases where connectives
such as and andFor interact with Fother logical
functors,
T
negation. Let us consider sentences (9a) and (10a), which are identical to (5a) and (6a) w
exception of the presence of a negative quantier (no, which means there is no individual) a
sentence in which disjunction is embedded under negation
to boys.
(reverts the truth condition)
(9)
First-order logic predicts the right meaning: no boys are eating any of the two kinds of food
(10) a No boys are eating a sandwich and an orange.
:dxdydzalgorithm:
[kid(x) ^ sandwich(y)
orange(z) logic
^ (eattruth
(x,y)function
^ eat (x,z))]
easy fix forbBarsalous
make OR like^First-order
2
OR (): Sentence
, means
that
there is no
boy eating a sa
(9a),separate
under itssub-events
more natural
interpretation
simulate two
alternating
the entity
under
disjunction
while
andholding
there isthe
no frame
boy eating
an orange
either. The
lastsub-event
part of formula
(9b),both
once applied to the
constant
and consider
a third
including
existential
(:dx),
accounts
for such meaning. That is, the disjunction under neg
entities.predication
Alternate the
three
sub-events
true just in case both disjuncts are false.
exception of the presence of a negative quantier (no, which means there is no individual) ap
to boys.
Formal Neurosemantics
(9)
Panizza, 2011
Sentence (9a), under its more natural interpretation2, means that there is no boy eating a san
and there is no boy eating an orange either. The last part of formula (9b), once applied to the n
existential predication (:dx), accounts for such meaning. That is, the disjunction under nega
First-order
logic
eating
a sandwich
and not and
true just in case
both disjuncts
are false. eating an orange
If we apply the Barsalous algorithm in (7) to interpret the disjunction in (9a) we will obtain the
T species that there
T is a Fmismatch betwe
T
meaning. Recall that, according
to Barsalou, negation
simulated and the perceived
situation. Thus, we rst
(9a)
F
F
T apply (7) to sentence
T and we get two
native sub-events in which some boy is eating a sandwich (the rst sub-event) and some boy is ea
F scenario
orange (the second sub-event).
Then we are to check
T
F whether the actual
T displays a di
situation. If no boy is eating sandwiches or oranges the meaning of (9a) turns out to be true and (7)
F
F
T both an oran
up working ne. But what if we are attending to a situation where someFboy is eating
a sandwich? Negation applied to the result of (7) would be satised in this case, as the actual sc
does not mach either any one of the alternative disjunctive frames, where some boy is eatin
Barsalous
one kind of food.
this is notone
what
(9a) containing
means, in that
such
a situation is clearly ruled o
ANDHowever,
(): 2b. simulate
frame
both
events
algorithm Barsalous algorithm for disjunctive meaning fails thereby to predict the right meaning of o
embedded under negation. The reason underlying its failure is that (7) implements just the mea
the exclusive interpretation of or. When disjunction is embedded under negation, people tend to
both algorithms
leave open the possibility that there is a boy only eating a sandwich or an orange
or an inclusive interpretation (cf. Chierchia, 2004). The author nevertheless admitted that his pr
was aimed
to offer
a viable
implement
one ofelse?
the possible meanings of or and negation. Fo
so far so good
but what
if there
is away
boyto
eating
something
Formal Neurosemantics
Panizza, 2011
ntence (9a), under its more natural interpretation2, means that there is no boy eating a sandwich
here is no boy eating an orange either. The last part of formula (9b), once applied to the negated
ential predication (:dx), accounts for such meaning. That is, the disjunction under negation is
ust in case both disjuncts are false.
we apply the Barsalous algorithm in (7) to interpret the disjunction in (9a) we will obtain the wrong
according
to Barsalous
algorithm,
ning. Recall that,
according
to Barsalou,
negation species that there is a mismatch between the
ated and theanything
perceived
situation.
Thus,awe
apply (7) to sentence (9a) and we get two alterthat
mismatches
boyrst
eating
e sub-eventsboth
in which
some boy
eatingisa TRUE!
sandwich (the rst sub-event) and some boy is eating an
sandwich
andis
orange
ge (the second sub-event). Then we are to check whether the actual scenario displays a different
tion. If no boy is eating sandwiches or oranges the meaning of (9a) turns out to be true and (7) winds
orking ne. Butitwhat
if we
are attending
to a situation
where some boy is eating both an orange and
would
include
the boy eating
an
dwich? Negation
applied
to the result
(7) would be satised in this case, as the actual scenario
orange,
a sandwich
and of
a banana.
not mach either
any one of the alternative disjunctive frames, where some boy is eating only
WRONG!
ind of food. However, this
notto
what
(9a) means, in that such a situation is clearly ruled out.
nois
way
fix this.
arsalous algorithm for disjunctive meaning fails thereby to predict the right meaning of or when
dded under negation. The reason underlying its failure is that (7) implements just the meaning of
xclusive interpretation of or. When disjunction is embedded under negation, people tend to assign
inclusive interpretation (cf. Chierchia, 2004). The author nevertheless admitted that his proposal
negation
rules
out any situation
imed tological
offer a viable
way
to implement
one of the possible meanings of or and negation. For, both
nce (Scalar Implicature) that is generally not computed (or suspended) under negation and conditionals, as empirically
Formal Neurosemantics
Panizza, 2011
1) COMPUTATIONAL LEVEL
2) ALGORITHMIC LEVEL
formal model: simplification, coded into a symbolic format, of a real word context or situation
abstract, symbolic and grammar-driven representations
logical operators (,,,), variables (x, y, z), set-theoretic operations (,,,)
predicates (boy(x)), higher-order logic systems ( , )
3) IMPLEMENTATION LEVEL
Formal Neurosemantics
Panizza, 2011
verbal un-prefixation
unbutton a shirt =
semantically constrained
Formal Neurosemantics
Panizza, 2011
SEMANTICS VS. WORLD KNOWLEDGE IN PFC
only semantic/compositional
violations elicit an effect at the
Ventromedial Prefrontal
Cortex (VmPFC)
11
Formal Neurosemantics
Panizza, 2011
time
that participants
have
available
for comprehending
com
r
view
the
picture
can
they
start
the
verification
processing even after athe
certai
ue nor false. Only when
Formal
Neurosemantics
lated d
th
This
allowed
us to manipulate
amount
of in both
Panizza, 2011
the the
comprehender
hey start the verification
participants
available
for
comprehending
lated
the depicted stateinofthe
affa
nipulate
the have
amount
of
Ldtke et al. (2008)
1. Sample Materialsin the unprimed conditions.
able for Table
comprehending
how do speakers process negation?
Sentence
Picture
real scenario
Picture
Picture
Relation
f the tower there is a ghost.
st.
Mentio
Relation
Simulations
Mentioned
Not
m
True
Not m
st.
Rel
Not mentioned
Not mentioned
Fals
Formal Neurosemantics
Panizza, 2011
delay
no delay
Formal Neurosemantics
2 delays:
exp. design
Picture
Relation
Simulations
Condition
Priming
Mentioned
True affirmative
Primed
Not mentioned
False affirmative
Not primed
Not mentioned
True negative
Not primed
Mentioned
False negative
Primed
predictions:
priming/mentioning
(True a. & False neg.)
mismatch
(False)
facilitates
Lu
dtke et al.
surprisal eect if
negation is processed
1357
Formal Neurosemantics
Panizza, 2011
results
frontal negativity
at 300ms
on the noun after
negation vs.
affirmative
early linguistic
processing
of negation
Figure 1. Grand mean averages related to ein/kein (a/no) and the following subject noun onset for selected electrode leads.
marked.
Formal Neurosemantics
short delay
(300 ms)
results
Panizza, 2011
Lu
dtke et a
truth/negation interaction
Lu
dtke et al.
Formal Neurosemantics
Panizza, 2011
frontal negativity
at 300ms
on the noun after
negation vs.
affirmative
truth/negation interaction
in all conditions
delay
2
main effect of negation
main effect of truth
only with long delay
Panizza, 2011
Formal Neurosemantics
the puzzle from NPIs
A:
B:
A:
B:
any = a
Formal Neurosemantics
another puzzle
from NPIs:
their distribution
neg
non-neg
Panizza, 2011
Panizza & Romoli (2013)
Formal Neurosemantics
Panizza, 2011
Panizza & Romoli (2013)
DOWNWARD ENTAILING
No man has ever set foot on the moon.
No man taller than 190 cm has ever set foot on the moon.
Every man who has ever set foot on the moon is famous
Every man taller than 190 cm who has ever set foot on the moon is famous
man-taller-than-190cm
men
UPWARD ENTAILING
A man taller than 190 cm has ever set foot on the moon.
A man has ever set foot on the moon.
Formal Neurosemantics
Panizza, 2011
Panizza & Romoli (2013)
Panizza, 2011
Formal Neurosemantics
J voted for B
M voted for B
P voted for B
A voted for B
Formal Neurosemantics
ever
Panizza, 2011
Panizza & Romoli (2013)
Panizza, 2011
Formal Neurosemantics
1996
2001
2006
2008
Panizza, 2011
Formal Neurosemantics
ever
2001
2006
2008
Panizza, 2011
Formal Neurosemantics
ever
OK!
2001
2006
2008
downward
entailment
Panizza, 2011
Formal Neurosemantics
ever
2001
2006
2008
Panizza, 2011
Formal Neurosemantics
ever
2001
2006
2008
Panizza, 2011
Formal Neurosemantics
ever
2001
2006
2008
upward
entailment
Panizza, 2011
Formal Neurosemantics
ever
1996
2001
2006
2008
upward
entailment
Formal Neurosemantics
goals
language-related
mechanisms
ERPs
conflicts
Panizza, 2011
Panizza & Romoli (2013)
cognitive processes
morpho-syntactic conflicts
Kaan and Swab
(2003)
(LAN) / P600
conceptual/lexical conflicts
Kutas and Hylliard
(1980)
N400
Formal Neurosemantics
Panizza, 2011
Panizza & Romoli (2013)
violation of a
linguistic rule
P600
unexpected word,
lexical conflict
last resort,
unconvincing
why?
N400
task-related effect
(conflict monitoring)
semantic/logical
violation
Formal Neurosemantics
Panizza, 2011
Panizza & Romoli (2013)
= meaning
= distribution
Ques%ons
Hai mai camminato sulla luna?
Have you ever walked on the moon?
Formal Neurosemantics
Panizza, 2011
Panizza & Romoli (2013)
research question
how does the parser know when mai is to be
interpreted as (n)ever?
on which kind of information does it rely?
when is this info accessed?
Panizza, 2011
Formal Neurosemantics
design
postverbal
control
a. Il mister credeva che i ragazzi non avrebbero mai giocato sotto la pioggia.
'The coach believed that the boys would not ever play under the rain.'
NPI
violation
b. *Il mister credeva che i ragazzi avrebbero mai giocato sotto la pioggia.
'The coach believed that the boys would ever play under the rain.'
preverbal
preverbal
mai
preverbal
violation
d. *Il mister credeva che i ragazzi non mai avrebbero giocato sotto la pioggia.
'The coach believed that the boys would never play under the rain.'
'The coach believed that the boys would not never play under the rain.'
Formal Neurosemantics
Panizza, 2011
Panizza & Romoli (2013)
design
preverbal
mai
perfect system
(predicting monotonicity)
imperfect system
Panizza, 2011
Formal Neurosemantics
predictions
perfect system
(predicting monotonicity)
NPI
- control
violation
cost of dealing with semantic
clash, fixing the structure &
meaning
NPI
- control
violation
cost of dealing with semantic
clash, fixing the structure &
meaning
different
processes
preverbal mai
control
imperfect system
(repair strategy)
preverbal mai
control
same
processes
cost of dealing with semantic
clash, adding a negation
Formal Neurosemantics
Panizza, 2011
Panizza & Romoli (2013)
(explorative)
preverbal
violation
d. *Il mister credeva che i ragazzi non mai avrebbero giocato sotto la pioggia.
'The coach believed that the boys would not never play under the rain.'
NPI violation
Panizza, 2011
Formal Neurosemantics
frontal electrode
200
200
400
results
600
800
postV gram
preV gram
postV ungram
preV ungram
Fz
Pz
FP600
4
N400
200
400
600
800
1000
1200
200
a. Il mister credeva che i ragazzi non avrebbero mai giocato sotto la pioggia.
control
NPI
violation
Cz
'The
coach believed that the boys would not ever play under the rain.'
200
b. *Il mister credeva che i ragazzi avrebbero mai giocato sotto la pioggia.
200
preverbal
violation
preverbal
mai
'The coach believed that the boys would ever play under the rain.'
d. *Il mister credeva che i ragazzi non mai avrebbero giocato sotto la pioggia.
'The coach believed that the boys would not never play under the rain.'
400
600
800
Panizza, 2011
200
200
Formal Neurosemantics
posterior electrode
results
600
800
1000
1200
200
postV gram
preV gram
postV ungram
preV ungram
200
400
600
800
postV gram
preV gram
postV ungram
preV ungram
Pz
Pz
N400
0
200
400
600
800
1000
1200
200
P600
control
a. Il mister credeva che i ragazzi non avrebbero mai giocato sotto la pioggia.
'The coach believed that the boys would not ever play under the rain.'
NPI
violation
200
200
b. *Il mister credeva che i ragazzi avrebbero mai giocato sotto la pioggia.
'The coach believed that the boys would ever play under the rain.'
preverbal
mai
preverbal
violation
d. *Il mister credeva che i ragazzi non mai avrebbero giocato sotto la pioggia.
'The coach believed that the boys would never play under the rain.'
'The coach believed that the boys would not never play under the rain.'
400
600
800
Panizza, 2011
200
200
central electrode
Formal Neurosemantics
600
800
1000
1200
200
results
200
400
800
postV gram
preV gram
postV ungram
preV ungram
FP600
Cz
600
Pz
N400
200
400
600
800
postV gram
preV gram
postV ungram
preV ungram
1000
1200
200
P600
Pz
2
200
200
preverbal
violation
preverbal mai
NPI
violation
400
600
800
Formal Neurosemantics
Panizza, 2011
Panizza & Romoli (2013)
discussion
grammatical control
a. Il mister credeva che i ragazzi non avrebbero mai giocato sotto la pioggia.
'The coach believed that the boys would not ever play under the rain.'
Panizza, 2011
Formal Neurosemantics
discussion
preverbal mai
Panizza, 2011
Formal Neurosemantics
discussion
NPI
violation
b. *Il mister credeva che i ragazzi avrebbero mai giocato sotto la pioggia.
'The coach believed that the boys would ever play under the rain.'
Panizza, 2011
Formal Neurosemantics
discussion
preverbal
violation
d. *Il mister credeva che i ragazzi non mai avrebbero giocato sotto la pioggia.
'The coach believed that the boys would not never play under the rain.'
Panizza, 2011
Formal Neurosemantics
preverbal mai
>
'The coach believed that the boys would never play under the rain.'
NPI
violation
preverbal
violation
b. *Il mister credeva che i ragazzi avrebbero mai giocato sotto la pioggia.
'The coach believed that the boys would ever play under the rain.'
why
an N400
for NPI
violations?
unexpected word,
lexical conflict
task-related effect
(conflict monitoring)
wrong predictions!
Panizza, 2011
Formal Neurosemantics
preverbal mai
NPI
violation
preverbal
violation
b. *Il mister credeva che i ragazzi avrebbero mai giocato sotto la pioggia.
'The coach believed that the boys would ever play under the rain.'
unexpected word,
lexical conflict
why?
wrong predictions!
task-related effect
(conflict monitoring)
semantic/logical
violation
provides a good
account
Formal Neurosemantics
preverbal mai
Panizza, 2011
Panizza & Romoli (2013)
morpho-syntactic conflicts
(LAN) / P600
semantic/logical conflicts
N400 / (FP600)
conceptual/lexical conflicts
N400