Learning Dependency-Based Compositional Semantics

Details Learning Dependency-Based Compositional Semantics Learning Dependency-Based Compositional Semantics

2011-09-30

arxiv.org/abs/1109.6841v1

Computer Science

Artificial Intelligence

Scientific paper

Suppose we want to build a system that answers a natural language question by representing its semantics as a logical form and computing the answer given a structured database of facts. The core part of such a system is the semantic parser that maps questions to logical forms. Semantic parsers are typically trained from examples of questions annotated with their target logical forms, but this type of annotation is expensive. Our goal is to learn a semantic parser from question-answer pairs instead, where the logical form is modeled as a latent variable. Motivated by this challenging learning problem, we develop a new semantic formalism, dependency-based compositional semantics (DCS), which has favorable linguistic, statistical, and computational properties. We define a log-linear distribution over DCS logical forms and estimate the parameters using a simple procedure that alternates between beam search and numerical optimization. On two standard semantic parsing benchmarks, our system outperforms all existing state-of-the-art systems, despite using no annotated logical forms.

Affiliated with

Also associated with

No associations

Rating

Learning Dependency-Based Compositional Semantics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Learning Dependency-Based Compositional Semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning Dependency-Based Compositional Semantics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-669545