DeepAI AI Chat
Log In Sign Up

An Improved Approach for Semantic Graph Composition with CCG

by   Austin Blodgett, et al.

This paper builds on previous work using Combinatory Categorial Grammar (CCG) to derive a transparent syntax-semantics interface for Abstract Meaning Representation (AMR) parsing. We define new semantics for the CCG combinators that is better suited to deriving AMR graphs. In particular, we define symmetric alternatives for the application and composition combinators: these require that the two constituents being combined overlap in one AMR relation. We also provide a new semantics for type raising, which is necessary for certain constructions. Using these mechanisms, we suggest an analysis of eventive nouns, which present a challenge for deriving AMR graphs. Our theoretical analysis will facilitate future work on robust and transparent AMR parsing using CCG.


page 1

page 2

page 3

page 4


Plurality and Quantification in Graph Representation of Meaning

In this thesis we present a semantic representation formalism based on d...

Polynomial Graph Parsing with Non-Structural Reentrancies

Graph-based semantic representations are valuable in natural language pr...

Semantic Journeys: Quantifying Change in Emoji Meaning from 2012-2018

The semantics of emoji has, to date, been considered from a static persp...

Rewriting Abstract Structures: Materialization Explained Categorically

The paper develops an abstract (over-approximating) semantics for double...

Whither Semantics?

We discuss how mathematical semantics has evolved, and suggest some new ...

Combining predicate transformer semantics for effects: a case study in parsing regular languages

This paper describes how to verify a parser for regular expressions in a...

A case for deep learning in semantics

Pater's target article builds a persuasive case for establishing stronge...