Abstract:

Logical representations and dependency structures are both used to describe aspects of the meaning of natural language sentences, but are formally very different. In this talk, I will show that one widely used form of logical representation can be transformed into graph structures comparable to dependency representations without loss of information. This has some significant practical advantages for language processing, which I will discuss in the context of the DELPH-IN (Deep Linguistic Processing with HPSG) collaboration.