Is there a way to present Prolog natural language parsing results in a tree form?

Hi, everyone,

According to the Prolog books I have, the parsing result of a natural
language sentence is like: (np(propN(john)), vp(v(hit), np(det(a),
n(dog)))). I am wondering whether there is a way to transform parsing
result of this type into a tree form, like the way the structure of a
sentence is presented in a syntax book?

Any help is appreciated!

Jiun-Shiung Wu
-------------- next part --------------
HTML attachment scrubbed and removed