Paper: Efficient Linear Logic Meaning Assembly

ACL ID P98-1077
Title Efficient Linear Logic Meaning Assembly
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1998
Authors

So the result is: Ifo, every RESTR). A Ax. Y. (go RESTR)] ]fo cat leave (go VAR)!: /o Similarly "gray" can modify this by splicing it into the line labeled (go VAR) --o (go RESTR) to yield (after y-reduction, and removing labels on the arcs). Ifo /ver gray leave I cat This gets us the expected meaning every(gray(cat), leave). In some cases, the link called for by a higher order modifier is not directly present in the tree, and we need to do A-abstraction to support it. Consider the sentence "John read Hamlet quickly". We get the following two trees from the skeleton deductions: re!fd g/ ho John Hamlet read(John, Hamlet) I go --o fo quickly Igo-o fo AP.Ax.quickly( P )( x ) There is no link labeled ga --o fa to be modified. fied. The left tree however may be converted by A-abstraction to the...