| Reference: Chapter 3 of
Allen, J., Natural Language Understanding, 2nd edition, Benjamin Cummings, 1995.
|
| Aim: |
To describe several types of formal grammars for natural language
processing, parse trees, and a number of parsing methods, including
a bottom-up chart parser in some detail.
We show the use of Prolog for syntactic parsing of natural language
text. Other issues in parsing, including PP attachment, are briefly
discussed.
|
| Keywords:
accepter,
active arc,
active chart,
alphabet (in grammar),
ATN,
augmented grammar,
augmented transition networks,
bottom-up parser,
CFG,
chart,
chart parsing,
Chomsky hierarchy,
constituent,
context-free,
context-sensitive,
CSG,
derivation,
distinguished non-terminal,
generalized phrase structure grammar,
generate,
GPSG,
grammar rule,
HDPSG,
head-driven phrase structure grammar,
language generated by a grammar,
left-to-right parsing,
lexical category,
lexical functional grammar,
lexical insertion rule,
lexical symbol,
lexicon,
LFG,
Marcus parsing,
non-terminal,
parse tree,
parser,
phrasal category,
pre-terminal,
predictive parser,
production,
regular,
rewriting process,
right-linear grammar,
right-to-left parsing,
robustness,
semantic grammar,
sentential form,
shift-reduce parser,
start symbol,
systemic grammar,
terminal,
top-down parser,
unrestricted grammar
|
| Plan: |
- parsers, parse trees
- context-free grammars, context-free rules
- lexical and phrasal categories
- Chomsky hierarchy: unrestricted > context-sensitive > context-free > regular
- derivation, sentential forms
- top-down parsing: predictive parser
- bottom-up parsing
- garden-path sentences, well-formed substring table
- chart parsing, bottom-up chart parser
- example of chart parser use
- parsing in Prolog
- problems and limitations in syntactic parsing
|
