On maximum spanning DAG algorithms for semantic DAG parsing

Abstract

Consideration of the decoding problem in semantic parsing as finding a maximum spanning DAG of a weighted directed graph carries many complexities that haven’t been fully addressed in the literature to date, among which are its actual appropriateness for the decoding task in semantic parsing, not to mention an explicit proof of its complexity (and its… (More)

2 Figures and Tables

Topics

  • Presentations referencing similar topics