CSCI 587 - Lecture 9 Augmented Transition Networks
- Prolog Introduction Continued
- Lists in prolog: Notation [ F | R ]
- Trees in list notation
- Lisp (a ((b c) (d e) f))
- Prolog [a ,[[b, c], [d, e], f]
- Recursive rules: append
- Top Down Parsing Algorithm
- Initialize the Possible State List to contain ((S) 1)
- Then Repeat the following steps
- Set C = first state on the List
- If C = (() end of sentence) then the algorithm succeeds
- Else generate next states by
- Matching a lexical symbol with the next word of the sentence
- Applying each applicable rule and add to the possibilities list
- The Algorithm Fails by ...
- Tracing Top Down Parses
- The Chomsky Hierarchy Box 3.1
- regular grammars
- context sensitive
- unrestricted
- NLP in Prolog: nlp, nlp2
- Intro to Augmented Transition Networks (ATNs)
- Test 1 Next Tuesday
- Readings
- Sections 3.5
- Prolog examples in /class/csci587/Prolog : family, nlp, nlp2
- Chapter 1 of Programming in Prolog by Clocksin and Mellish.
- Reading Room Sumwalt 203
URL = http://sourgum.cs.sc.edu/~matthews/Courses/587/Lectures/lecture9.html