| Aim: |
To describe an interpretation algorithm that uses the syntactic
analysis of a sentence together with grammar rules augmented by
feature information describing how the semantic analysis of a phrase
is derived from the semantic analyses of its constituents. We shall
show how this works for a simple grammar and then investigate a
few more complicated examples, including the handling of auxiliary
verbs, and prepositional phrases.
The concepts of lambda-expression and lambda-reduction are central
to the handling of certain grammar rules.
|
| Reference: Chapter 9 of Allen, J.: Natural Language
Understanding, 2nd ed., Benjamin Cummings, 1995. |
| Keywords:
CNP,
common noun phrase,
lambda reduction,
VAR feature
|
| Plan: |
- Every constituent must have an interpretation - lambda-expressions, lambda-reduction
- Example: grammar rules with semantic interpretation via features
- The VAR feature
- Lexicon entries with SEM features
- Handling PPs and VPs with lambda-expressions
- Handling different types of PPs
|
