Professional Documents
Culture Documents
Natural Language Processing
Natural Language Processing
Natural Language Processing
Ann Copestake
Computer Laboratory
University of Cambridge
October 2010
Natural Language Processing
Lecture 1: Introduction
Overview of the course
Why NLP is hard
Scope of NLP
A sample application: sentiment classification
More NLP applications
NLP components
Natural Language Processing
Lecture 1: Introduction
Overview of the course
Also note:
ORDER
Order number Date ordered Date shipped
4290 2/2/09 2/2/09
4291 2/2/09 2/2/09
4292 2/2/09
Wouldn’t it be better if . . . ?
Wouldn’t it be better if . . . ?
Ooooo. Scary.
The old adage of the simplest ideas being the best is
once again demonstrated in this, one of the most
entertaining films of the early 80’s, and almost
certainly Jon Landis’ best work to date. The script is
light and witty, the visuals are great and the
atmosphere is top class. Plus there are some great
freeze-frame moments to enjoy again and again. Not
forgetting, of course, the great transformation scene
which still impresses to this day.
In Summary: Top banana
Natural Language Processing
Lecture 1: Introduction
A sample application: sentiment classification
Sentiment words
thanks
Natural Language Processing
Lecture 1: Introduction
A sample application: sentiment classification
Sentiment words
thanks
Sentiment words
never
Natural Language Processing
Lecture 1: Introduction
A sample application: sentiment classification
Sentiment words
never
Sentiment words
quite
Natural Language Processing
Lecture 1: Introduction
A sample application: sentiment classification
Sentiment words
quite
ever
Natural Language Processing
Lecture 1: Introduction
A sample application: sentiment classification
I Negation:
Ridley Scott has never directed a bad film.
More contrasts
Sample data
http://www.cl.cam.ac.uk/~aac10/sentiment/
(linked from
http://www.cl.cam.ac.uk/~aac10/stuff.html)
See test data texts in:
http://www.cl.cam.ac.uk/~aac10/sentiment/test/
classified into positive/negative.
Natural Language Processing
Lecture 1: Introduction
A sample application: sentiment classification
IR, IE and QA
MT
Human translation?
Natural Language Processing
Lecture 1: Introduction
More NLP applications
Human translation?
KB
*
j
KB INTERFACE KB OUTPUT
6
?
PARSING TACTICAL GENERATION
6
?
MORPHOLOGY MORPHOLOGY GENERATION
6
?
INPUT PROCESSING OUTPUT PROCESSING
6
?
user input output
Natural Language Processing
Lecture 1: Introduction
NLP components
General comments
I Even ‘simple’ applications might need complex knowledge
sources
I Applications cannot be 100% perfect
I Applications that are < 100% perfect can be useful
I Aids to humans are easier than replacements for humans
I NLP interfaces compete with non-language approaches
I Shallow processing on arbitrary input or deep processing
on narrow domains
I Limited domain systems require extensive and expensive
expertise to port
I External influences on NLP are very important
Natural Language Processing
Lecture 1: Introduction
NLP components
Some terminology
Inflectional morphology
Derivational morphology
j
KB INTERFACE KB OUTPUT
6
?
PARSING TACTICAL GENERATION
6
?
MORPHOLOGY MORPHOLOGY GENERATION
6
?
INPUT PROCESSING OUTPUT PROCESSING
6
?
user input output
Natural Language Processing
Lecture 2: Morphology and finite state techniques
Using morphology
Mongoose
Mongoose
Mongoose
e-insertion
e.g. boxˆs to boxes
s
ε → e/ x ˆ s
z
e-insertion
e.g. boxˆs to boxes
s
ε → e/ x ˆ s
z
e-insertion
e.g. boxˆs to boxes
s
ε → e/ x ˆ s
z
1 2 3 4 5 6
digit digit
Recursive FSA
comma-separated list of day/month pairs:
1 2 3 4 5 6
digit digit
1 2 3
e:e s:s
x:x
other : other z:z e: ˆ s
ε → e/ x ˆ s
z
4
surface : underlying
s:s cakes↔cakeˆs
x:x
z:z boxes↔boxˆs
Natural Language Processing
Lecture 2: Morphology and finite state techniques
Finite state techniques
Analysing b o x e s
b:b
ε: ˆ
1 2 3
Input: b
4 Output: b
(Plus: . ˆ)
Natural Language Processing
Lecture 2: Morphology and finite state techniques
Finite state techniques
Analysing b o x e s
b:b
ε: ˆ
1 2 3
Input: b
4 Output: b
(Plus: . ˆ)
Natural Language Processing
Lecture 2: Morphology and finite state techniques
Finite state techniques
Analysing b o x e s
o:o
1 2 3
4 Input: b o
Output: b o
Natural Language Processing
Lecture 2: Morphology and finite state techniques
Finite state techniques
Analysing b o x e s
1 2 3
x:x
4 Input: b o x
Output: b o x
Natural Language Processing
Lecture 2: Morphology and finite state techniques
Finite state techniques
Analysing b o x e s
1 2 3
e:e
e: ˆ
Input: b o x e
4 Output: b o x ˆ
Output: b o x e
Natural Language Processing
Lecture 2: Morphology and finite state techniques
Finite state techniques
Analysing b o x e s
ε: ˆ
1 2 3
Input: b o x e
Output: b o x ˆ
Output: b o x e
4 Input: b o x e
Output: b o x e ˆ
Natural Language Processing
Lecture 2: Morphology and finite state techniques
Finite state techniques
Analysing b o x e s
s:s
1 2 3
s:s Input: b o x e s
Output: b o x ˆ s
Output: b o x e s
4 Input: b o x e s
Output: b o x e ˆ s
Natural Language Processing
Lecture 2: Morphology and finite state techniques
Finite state techniques
Analysing b o x e s
e:e
other : other
ε: ˆ s:s
1 2 3
Using FSTs
mumble
1
mumble mumble
month day
2 day & 3
month
day month
4
Natural Language Processing
Lecture 2: Morphology and finite state techniques
More applications for finite state techniques
0.1
1
0.1 0.2
0.5 0.1
2 0.3 3
0.9 0.8
4
Natural Language Processing
Lecture 2: Morphology and finite state techniques
More applications for finite state techniques
Next lecture
First of three lectures that concern syntax (i.e., how words fit
together). This lecture: ‘shallow’ syntax: word sequences and
POS tags. Next lectures: more detailed syntactic structures.
Natural Language Processing
Lecture 3: Prediction and part-of-speech tagging
Corpora in NLP
Corpora
Changes in NLP research over the last 15-20 years are largely
due to increased availability of electronic corpora.
I corpus: text that has been collected for some purpose.
I balanced corpus: texts representing different genres
genre is a type of text (vs domain)
I tagged corpus: a corpus annotated with POS tags
I treebank: a corpus annotated with parse trees
I specialist corpora — e.g., collected to train or evaluate
particular applications
I Movie reviews for sentiment classification
I Data collected from simulation of a dialogue system
Natural Language Processing
Lecture 3: Prediction and part-of-speech tagging
Corpora in NLP
Prediction
Prediction
Prediction
Prediction
P(wn |wn−1 )
Calculating bigrams
hsi good morning h/si hsi good afternoon h/si hsi good
afternoon h/si hsi it is very good h/si hsi it is good h/si
Sentence probabilities
Practical application
Assigning probabilities
Our estimate of the sequence of n tags is the sequence of n
tags with the maximum probability, given the sequence of n
words:
t̂1n = argmax P(t1n |w1n )
t1n
By Bayes theorem:
Hence:
n
Y
t̂1n = argmax P(wi |ti )P(ti |ti−1 )
t1n i=1
Natural Language Processing
Lecture 3: Prediction and part-of-speech tagging
Part-of-speech (POS) tagging
Example
Evaluation in general
I Training data and test data Test data must be kept unseen,
often 90% training and 10% test data.
I Baseline
I Ceiling Human performance on the task, where the ceiling
is the percentage agreement found between two
annotators (interannotator agreement)
I Error analysis Error rates are nearly always unevenly
distributed.
I Reproducibility
Natural Language Processing
Lecture 3: Prediction and part-of-speech tagging
Evaluation in general, evaluation of POS tagging
Generative grammar
a formally specified grammar that can generate all and only the
acceptable sentences of a natural language
Internal structure:
can be bracketed
NP ->
Natural Language Processing
Lecture 4: Parsing and generation
Simple context free grammars
lexicon
rules V -> can
V -> fish
S -> NP VP
NP -> fish
VP -> VP PP
NP -> rivers
VP -> V
NP -> pools
VP -> V NP
NP -> December
VP -> V VP
NP -> Scotland
NP -> NP PP
NP -> it
PP -> P NP
NP -> they
P -> in
Natural Language Processing
Lecture 4: Parsing and generation
Simple context free grammars
(S (NP they)
(VP (VP (V fish))
(PP (P in) (NP rivers)
(PP (P in) (NP December)))))
(S (NP they)
(VP (VP (VP (V fish))
(PP (P in) (NP rivers)))
(PP (P in) (NP December))))
Natural Language Processing
Lecture 4: Parsing and generation
Simple context free grammars
(S (NP they)
(VP (VP (V fish))
(PP (P in) (NP rivers)
(PP (P in) (NP December)))))
(S (NP they)
(VP (VP (VP (V fish))
(PP (P in) (NP rivers)))
(PP (P in) (NP December))))
Natural Language Processing
Lecture 4: Parsing and generation
Simple context free grammars
Parse trees
S
NP VP
they V VP
can VP PP
V P NP
fish in December
(S (NP they)
(VP (V can)
(VP (VP (V fish))
(PP (P in)
(NP December)))))
Natural Language Processing
Lecture 4: Parsing and generation
Random generation with a CFG
Chart parsing
A dynamic programming algorithm (memoisation):
chart store partial results of parsing in a vector
edge representation of a rule application
Edge data structure:
[id,left_vtx, right_vtx,mother_category, dtrs]
Fragment of chart:
id l r ma dtrs
5 2 3 V (fish)
6 2 3 VP (5)
7 1 3 VP (3 6)
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Parse:
Initialize the chart
For each word word, let from be left vtx,
to right vtx and dtrs be (word)
For each category category
lexically associated with word
Add new edge from, to, category, dtrs
Output results for all spanning edges
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Inner function
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Parse construction
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
word = they, categories = {NP}
Add new edge 0, 1, NP, (they)
Matching grammar rules: {VP→V NP, PP→P NP}
No matching edges corresponding to V or P
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Parse construction
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
word = can, categories = {V}
Add new edge 1, 2, V, (can)
Matching grammar rules: {VP→V}
recurse on edges {(2)}
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Parse construction
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Add new edge 1, 2, VP, (2)
Matching grammar rules: {S→NP VP, VP→V VP}
recurse on edges {(1,3)}
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Parse construction
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Add new edge 0, 2, S, (1, 3)
No matching grammar rules for S
Matching grammar rules: {S→NP VP, VP→V VP}
No edges for V VP
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Parse construction
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
word = fish, categories = {V, NP}
Add new edge 2, 3, V, (fish) NB: fish as V
Matching grammar rules: {VP→V}
recurse on edges {(5)}
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Parse construction
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Add new edge 2, 3, VP, (5)
Matching grammar rules: {S →NP VP, VP →V VP}
No edges match NP
recurse on edges for V VP: {(2,6)}
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Parse construction
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Add new edge 1, 3, VP, (2, 6)
Matching grammar rules: {S→NP VP, VP→V VP}
recurse on edges for NP VP: {(1,7)}
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Parse construction
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Add new edge 0, 3, S, (1, 7)
No matching grammar rules for S
Matching grammar rules: {S→NP VP, VP →V VP}
No edges matching V
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Parse construction
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Add new edge 2, 3, NP, (fish) NB: fish as NP
Matching grammar rules: {VP→V NP, PP→P NP}
recurse on edges for V NP {(2,9)}
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Parse construction
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Add new edge 1, 3, VP, (2, 9)
Matching grammar rules: {S→NP VP, VP→V VP}
recurse on edges for NP VP: {(1, 10)}
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Parse construction
11:S
10:VP
8:S 9:NP
4:S 7:VP
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Add new edge 0, 3, S, (1, 10)
No matching grammar rules for S
Matching grammar rules: {S→NP VP, VP→V VP}
No edges corresponding to V VP
Matching grammar rules: {VP→V NP, PP→P NP}
No edges corresponding to P NP
Natural Language Processing
Lecture 4: Parsing and generation
Simple chart parsing with CFGs
Packing
I exponential number of parses means exponential time
I body can be cubic time: don’t add equivalent edges as
whole new edges
I dtrs is a set of lists of edges (to allow for alternatives)
about to add: [id,l_vtx, right_vtx,ma_cat, dtrs]
and there is an existing edge:
Packing example
1 0 1 NP {(they)}
2 1 2 V {(can)}
3 1 2 VP {(2)}
4 0 2 S {(1 3)}
5 2 3 V {(fish)}
6 2 3 VP {(5)}
7 1 3 VP {(2 6)}
8 0 3 S {(1 7)}
9 2 3 NP {(fish)}
Packing example
8:S 9:NP
4:S 7:VP+
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Both spanning results can now be extracted from edge 8.
Natural Language Processing
Lecture 4: Parsing and generation
More advanced chart parsing
Packing example
10:VP
8:S 9:NP
4:S 7:VP+
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Both spanning results can now be extracted from edge 8.
Natural Language Processing
Lecture 4: Parsing and generation
More advanced chart parsing
Packing example
8:S 9:NP
4:S 7:VP+
3:VP 6:VP
1:NP 2:V 5:V
they can fish
Both spanning results can now be extracted from edge 8.
Natural Language Processing
Lecture 4: Parsing and generation
More advanced chart parsing
More importantly:
1. FSM grammars are extremely redundant
2. FSM grammars don’t support composition of semantics
Natural Language Processing
Lecture 4: Parsing and generation
Formalism power requirements
More importantly:
1. FSM grammars are extremely redundant
2. FSM grammars don’t support composition of semantics
Natural Language Processing
Lecture 4: Parsing and generation
Formalism power requirements
Subcategorization
Overgeneration:
Long-distance dependencies
1. which problem did you say you don’t understand?
2. who do you think Kim asked Sandy to hit?
3. which kids did you say were making all that noise?
‘gaps’ (underscores below)
1. which problem did you say you don’t understand _?
2. who do you think Kim asked Sandy to hit _?
3. which kids did you say _ were making all that noise?
In 3, the verb were shows plural agreement.
* what kid did you say _ were making all that noise?
The gap filler has to be plural.
I Informally: need a ‘gap’ slot which is to be filled by
something that itself has features.
Natural Language Processing
Lecture 5: Parsing with constraint-based grammars
Feature structures
CASE []
AGR sg
CASE [ ]
1. u CASE nom = CASE nom
AGR sg AGR [ ] AGR sg
CASE [ ]
u AGR [ ] = CASE [ ]
h i
2.
AGR sg AGR sg
CASE [ ]
3. u CASE nom = fail
AGR sg AGR pl
Natural Language Processing
Lecture 5: Parsing with constraint-based grammars
Feature structures (informally)
Example 2:
HEAD- CAT -NP
HEAD CAT NP
AGR
AGR []
j
Reentrancy
: a
F
F a
G G a
- a
F F 0 a
G G 0
a z
-
Reentrancy indicated by boxed integer in AVM diagram:
indicates path goes to the same node.
Natural Language Processing
Lecture 5: Parsing with constraint-based grammars
Encoding agreement
FS grammar fragment
encoding
agreement
CAT S CAT NP CAT VP
subj-verb rule → ,
AGR 1 AGR 1 AGR 1
CAT VP CAT V CAT NP
verb-obj rule → ,
AGR 1 AGR 1 AGR []
h i
Root structure: CAT S
CAT NP CAT NP CAT V
they it likes
AGR pl AGR sg AGR sg
CAT NP V
fish like CAT
AGR [ ] AGR pl
Natural Language Processing
Lecture 5: Parsing with constraint-based grammars
Parsing with feature structures
Rules as FSs
But what does the coindexation of parts of the rule mean? Treat
rule as a FS: e.g., rule features MOTHER, DTR 1, DTR 2 . . . DTRN.
CAT VP
informally: → CAT V , CAT NP
AGR 1 AGR 1 AGR [ ]
MOTHER VP CAT
AGR 1
CAT V
actually: DTR 1
AGR 1
DTR 2 CAT NP
AGR [ ]
Natural Language Processing
Lecture 5: Parsing with constraint-based grammars
Parsing with feature structures
Properties of FSs
Connectedness and unique root A FS must have a unique root
node: apart from the root node, all nodes have
one or more parent nodes.
Unique features Any node may have zero or more arcs leading
out of it, but the label on each (that is, the feature)
must be unique.
No cycles No node may have an arc that points back to the
root node or to a node that intervenes between it
and the root node.
Values A node which does not have any arcs leading out
of it may have an associated atomic value.
Finiteness A FS must have a finite number of nodes.
Natural Language Processing
Lecture 5: Parsing with constraint-based grammars
Feature stuctures more formally
Subsumption
Feature structures are ordered by information content — FS1
subsumes FS2 if FS2 carries extra information.
FS1 subsumes FS2 if and only if the following conditions hold:
Path values For every path P in FS1 there is a path P in FS2. If
P has a value t in FS1, then P also has value t in
FS2.
Path equivalences Every pair of paths P and Q which are
reentrant in FS1 (i.e., which lead to the same node
in the graph) are also reentrant in FS2.
Unification
The unification of two FSs FS1 and FS2 is the most general FS
which is subsumed by both FS1 and FS2, if it exists.
Natural Language Processing
Lecture 5: Parsing with constraint-based grammars
Encoding subcategorisation
1 HEAD 1
HEAD
Verb-obj rule: OBJ filled → OBJ 2 , 2 OBJ filled
SUBJ 3 SUBJ 3
verb CAT
HEAD AGR pl
can (transitive verb):
OBJ HEAD CAT noun
OBJ filled
SUBJ HEAD CAT noun
Natural Language Processing
Lecture 5: Parsing with constraint-based grammars
Encoding subcategorisation
1 HEAD 1
HEAD
Verb-obj rule: OBJ fld → OBJ 2 , 2 OBJ fld
SUBJ 3 SUBJ 3
v CAT
HEAD AGR pl
can (transitive verb):
OBJ HEAD CAT n
OBJ
fld
SUBJ HEAD CAT n
Natural Language Processing
Lecture 5: Parsing with constraint-based grammars
Encoding subcategorisation
CAT n
HEAD AGR pl
Lexical entry for they:
OBJ fld
SUBJ fld
unify this with first dtr position:
CAT v CAT n
HEAD 1
AGR 3 pl HEAD AGR 3 HEAD 1
→ 2 , OBJ fld
OBJ fld OBJ fld
SUBJ 2
SUBJ fld SUBJ fld
HEAD CAT v
Root is: OBJ fld
SUBJ fld
Mother structure unifies with root, so valid.
Natural Language Processing
Lecture 5: Parsing with constraint-based grammars
Encoding subcategorisation
Templates
Noun entry
HEAD CAT
n
AGR
[]
OBJ fld
fish
SUBJ fld
INDEX 1
SEM PRED fish_n
ARG 1 1
Noun entry
HEAD CAT
n
AGR
[]
OBJ fld
fish
SUBJ fld
INDEX 1
SEM PRED fish_n
ARG 1 1
Verb entry
HEAD CAT v
AGR pl
h i
HEAD CAT n
OBJ fld
OBJ
h i
SEM INDEX 2
like
h i
CAT n
HEAD
SUBJ
h
i
SEM INDEX 1
PRED like_v
ARG 1 1
SEM
ARG 2 2
Natural Language Processing
Lecture 6: Compositional and lexical semantics
Compositional semantics in feature structures
Verb-object rule
HEAD 1
OBJ fld HEAD 1
SUBJ 3
→ OBJ 2 , 2 OBJ fld
PRED and
SUBJ 3 SEM 5
SEM ARG 1 4
SEM 4
ARG 2 5
I As last time: object of the verb (DTR2) ‘fills’ the OBJ slot
I New: semantics on the mother is the ‘and’ of the semantics
of the dtrs
Natural Language Processing
Lecture 6: Compositional and lexical semantics
Logical forms
Meaning postulates
I e.g.,
bachelor0 (Kim)
unmarried0 (Kim)
Hyponymy: IS-A:
I (a sense of) dog is a hyponym of (a sense of) animal
I animal is a hypernym of dog
I hyponymy relationships form a taxonomy
I works best for concrete nouns
Meronomy: PART-OF e.g., arm is a meronym of body, steering
wheel is a meronym of car (piece vs part)
Synonymy e.g., aubergine/eggplant
Antonymy e.g., big/little
Natural Language Processing
Lecture 6: Compositional and lexical semantics
Lexical semantics: semantic relations
WordNet
I large scale, open source resource for English
I hand-constructed
I wordnets being built for other languages
I organized into synsets: synonym sets (near-synonyms)
Overview of adj red:
1. (43) red, reddish, ruddy, blood-red, carmine,
cerise, cherry, cherry-red, crimson, ruby,
ruby-red, scarlet - (having any of numerous
bright or strong colors reminiscent of the color
of blood or cherries or tomatoes or rubies)
2. (8) red, reddish - ((used of hair or fur)
of a reddish brown color; "red deer";
reddish hair")
Natural Language Processing
Lecture 6: Compositional and lexical semantics
Lexical semantics: semantic relations
Hyponymy in WordNet
Sense 6
big cat, cat
=> leopard, Panthera pardus
=> leopardess
=> panther
=> snow leopard, ounce, Panthera uncia
=> jaguar, panther, Panthera onca,
Felis onca
=> lion, king of beasts, Panthera leo
=> lioness
=> lionet
=> tiger, Panthera tigris
=> Bengal tiger
=> tigress
Natural Language Processing
Lecture 6: Compositional and lexical semantics
Lexical semantics: semantic relations
Polysemy
WSD techniques
Initial state
? ?? ? ?
? ?
? ??
? ? ?
?? ?
? ? ?
?? ? ? ?
? ?
? ? ?
? ?
Natural Language Processing
Lecture 6: Compositional and lexical semantics
Word sense disambiguation
Seeds
? ?? ? B
? B
? ?? manu.
? ? ?
?? life ?
A ? ?
?? A A ?
? A
? A ?
? ?
Natural Language Processing
Lecture 6: Compositional and lexical semantics
Word sense disambiguation
Iterating:
? ?? ? B
B B
? ??
animal ? ? ?
company
AA B
A ? ?
?? A A ?
? A
? A ?
? ?
Natural Language Processing
Lecture 6: Compositional and lexical semantics
Word sense disambiguation
Final:
A AA B B
B B
A BB
A B B
AA B
A B B
AA A A B
A A
A A B
A B
Natural Language Processing
Lecture 6: Compositional and lexical semantics
Word sense disambiguation
Evaluation of WSD
I SENSEVAL competitions
I evaluate against WordNet
I baseline: pick most frequent sense — hard to beat (but
don’t always know most frequent sense)
I human ceiling varies with words
I MT task: more objective but sometimes doesn’t
correspond to polysemy in source language
Natural Language Processing
Lecture 6: Compositional and lexical semantics
Word sense disambiguation
Lecture 7: Discourse
Relationships between sentences
Coherence
Anaphora (pronouns etc)
Algorithms for anaphora resolution
Natural Language Processing
Lecture 7: Discourse
Lecture 7: Discourse
Relationships between sentences
Coherence
Anaphora (pronouns etc)
Algorithms for anaphora resolution
Natural Language Processing
Lecture 7: Discourse
Relationships between sentences
Rhetorical relations
Coherence
Can be OK in context:
Kim got into her car. Sandy likes apples, so Kim thought she’d
go to the farm shop and see if she could get some.
Natural Language Processing
Lecture 7: Discourse
Coherence
Coherence
Can be OK in context:
Kim got into her car. Sandy likes apples, so Kim thought she’d
go to the farm shop and see if she could get some.
Natural Language Processing
Lecture 7: Discourse
Coherence
Coherence in generation
Strategic generation: constructing the logical form. Tactical
generation: logical form to string.
Strategic generation needs to maintain coherence.
Better:
So far this has only been attempted for limited domains: e.g.
tutorial dialogues.
Natural Language Processing
Lecture 7: Discourse
Coherence
Coherence in interpretation
1. Cue phrases.
2. Punctuation (also prosody) and text structure.
Max fell (John pushed him) and Kim laughed.
Max fell, John pushed him and Kim laughed.
3. Real world content:
Max fell. John pushed him as he lay on the ground.
4. Tense and aspect.
Max fell. John had pushed him.
Max was falling. John pushed him.
Hard problem, but ‘surfacy techniques’ (punctuation and cue
phrases) work to some extent.
Natural Language Processing
Lecture 7: Discourse
Coherence
Referring expressions
Pronoun resolution
Pronoun resolution
Pronoun resolution
World knowledge
they is Australia.
But a discourse can be odd if strong salience effects are
violated:
World knowledge
they is Australia.
But a discourse can be odd if strong salience effects are
violated:
Example
Example
Features
Cataphoric Binary: t if pronoun before antecedent.
Number agreement Binary: t if pronoun compatible with
antecedent.
Gender agreement Binary: t if gender agreement.
Same verb Binary: t if the pronoun and the candidate
antecedent are arguments of the same verb.
Sentence distance Discrete: { 0, 1, 2 . . . }
Grammatical role Discrete: { subject, object, other } The role of
the potential antecedent.
Parallel Binary: t if the potential antecedent and the
pronoun share the same grammatical role.
Linguistic form Discrete: { proper, definite, indefinite, pronoun }
Natural Language Processing
Lecture 7: Discourse
Algorithms for anaphora resolution
Feature vectors
pron ante cat num gen same dist role par form
him Niall F. f t t f 1 subj f prop
him Ste. M. f t t t 0 subj f prop
him he t t t f 0 subj f pron
he Niall F. f t t f 1 subj t prop
he Ste. M. f t t f 0 subj t prop
he him f t t f 0 obj f pron
Natural Language Processing
Lecture 7: Discourse
Algorithms for anaphora resolution
Evaluation
Classification in NLP