Notes on computational linguistics.pdf - UCLA Department of ...

Stabler - Lx 185/209 2003
(41) With these files, we get the following session: | ?- [’g5-mix’,’oracle-sics’,glco].
yes
| ?- computeOracle.
Warning: abolish(user:nrR) - no matching predicate
................:::.:.:.:.:.:.:..:..:.:.:.:.:.:.::.:.:.::.:.:.:.:::.:.::.:.::.::.::.::.::::.:
yes
| ?- listing(nrR).
nrR([-(about),p0|_]).
nrR([-(about),p1|_]).
nrR([-(about),pp|_]).
nrR([-(d0),d1|_]).
nrR([-(d0),dp|_]).
nrR([-(d0),ip|_]).
nrR([-(d1),dp|_]).
nrR([-(d1),ip|_]).
nrR([-(dp),ip|_]).
nrR([-(i1),-(dp),ip|_]).
nrR([-(idea),n0|_]).
nrR([-(idea),n1|_]).
nrR([-(idea),np|_]).
nrR([-(n0),n1|_]).
nrR([-(n0),np|_]).
nrR([-(n1),n1|_]).
nrR([-(n1),np|_]).
nrR([-(p0),p1|_]).
nrR([-(p0),pp|_]).
nrR([-(p1),pp|_]).
nrR([-(suffice),v0|_]).
nrR([-(suffice),v1|_]).
nrR([-(suffice),vp|_]).
nrR([-(the),d0|_]).
nrR([-(the),d1|_]).
nrR([-(the),dp|_]).
nrR([-(the),ip|_]).
nrR([-(v0),v1|_]).
nrR([-(v0),vp|_]).
nrR([-(v1),vp|_]).
yes
| ?- [the,idea,will,suffice] ? ˜ [ip].
yes
| ?- [the,idea,about,the,idea,will,suffice] ? ˜ [ip].
yes
| ?- [will,the,idea,suffice] ? ˜ [ip].
no
| ?- [the,idea] ? ˜ [C].
C = d1 ? ;
C = dp ? ;
no
(42) With this oracle, we can repair g3.pl to allow the left recursive rule for coordination, and an empty i0.
The resulting file g3-lc.pl lets us recognize, for example, the ip: some penguins and most songs
praise titus. As observed earlier, we were never able to do this before. 27
(43) Thecalculationoftheoraclecanstillfailtoterminate. To ensure termination, we need to restrict both
the length of the trigger sequences, and also the complexity of the arguments (if any) associated with
the categories in the sequence.
93