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

Stabler - Lx 185/209 2003
Problem (4), Solution 1:
%File: badprog.pl
% not so bad, really!
% first, we load the first 2 columns of the Mitton lexicon
:- [col12].
test :- translate([’D’,’@’,k,’\&’,t,’I’,z,’O’,n,’D’,’@’,m,’\&’,t],Words), write(Words).
%translate(Phones,Words)
translate([],[]).
translate(Phones,[Word|Words]) :append(FirstPhones,RestPhones,Phones),
lex(Word,FirstPhones),
translate(RestPhones,Words).
We can test this program like this:
1 ?- [badprog].
% col12 compiled 2.13 sec, 52 bytes
% badprog compiled 2.13 sec, 196 bytes
Yes
2 ?- translate([’D’,’@’,k,’&’,t,’I’,z,’0’, n,’D’,’@’,m,’&’,t],Words).
Words = [the, cat, is, on, the, ’Matt’] ;
Words = [the, cat, is, on, the, mat] ;
Words = [the, cat, is, on, the, matt] ;
No
3 ?-
Part b of the problem asks us to integrate this kind of translation into the syntactic recognizer. Since we only
want to do a dictionary lookup when we have a syntactic lexical item of the syntax, let’s represent the lexical
items in the syntax with lists, like this:
ip :˜ [dp, i1]. i1 :˜ [i0, vp]. i0 :˜ [].
dp :˜ [d1]. d1 :˜ [d0, np]. d0 :˜ [[t,h,e]].
np :˜ [n1]. n1 :˜ [n0]. n0 :˜ [[c,a,t]]. n0 :˜ [[m,a,t]].
vp :˜ [v1]. v1 :˜ [v0,pp]. v0 :˜ [[i,s]].
pp :˜ [p1]. p1 :˜ [p0,dp]. p0 :˜ [[o,n]].
Now the syntactic atoms have a phonetic structure, as a list of characters. We test this grammar in the following
session – notice each word is spelled out as a sequence of characters.
2 ?- [badprog].
% badprog compiled 0.00 sec, 2,760 bytes
Yes
3 ?- ([[t,h,e],[c,a,t],[i,s],[o,n],[t,h,e],[m,a,t]] ?˜ [ip]).
34