Semantic Construction from Parse Forests

The paper describes a system which uses packed parser output directly to build semantic representations. More specifically, the system takes as input Packed Shared Forests in the sense of Tomita (l_bmita, 1985) and produces packed Underspeeified Discourse Representation Structures. The algorithm visits every node in the Parse Forest only a bounded number of times, so that a significant increase in efficiency is registered for ambiguous sentences.

• Type: Conference
• Year: 1996
• Where: COLING
• Authors: Michael Schiehlen
• Keywords: COLING 1996, COLING 2008, Discourse Representation Structures, Parser Output, Semantic Representations