Lambda Dependency-Based Compositional Semantics

TL;DR

This paper introduces lambda DCS, a new formal language for semantic parsing that simplifies logical forms by removing variables and implicit quantification, resulting in more compact representations.

Contribution

The paper presents lambda DCS, a novel formal language that improves the compactness and simplicity of logical forms in semantic parsing.

Findings

Lambda DCS produces more compact logical forms than lambda calculus.

Eliminating variables simplifies the structure of semantic representations.

Implicit existential quantification enhances the expressiveness of lambda DCS.

Abstract

This short note presents a new formal language, lambda dependency-based compositional semantics (lambda DCS) for representing logical forms in semantic parsing. By eliminating variables and making existential quantification implicit, lambda DCS logical forms are generally more compact than those in lambda calculus.