Simple, Fast Semantic Parsing with a Tensor Kernel

07/02/2015
by   Daoud Clarke, et al.
0

We describe a simple approach to semantic parsing based on a tensor product kernel. We extract two feature vectors: one for the query and one for each candidate logical form. We then train a classifier using the tensor product of the two vectors. Using very simple features for both, our system achieves an average F1 score of 40.1 more complex systems but is simpler to implement and runs faster.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2019

Testing tensor products

A function f:[n]^d→F_2 is a direct sum if it is of the form f((a_1,...,...
research
02/20/2018

Attentive Tensor Product Learning for Language Generation and Grammar Parsing

This paper proposes a new architecture - Attentive Tensor Product Learni...
research
05/01/2023

A note on generalized tensor CUR approximation for tensor pairs and tensor triplets based on the tubal product

In this note, we briefly present a generalized tensor CUR (GTCUR) approx...
research
05/01/2020

Syntactic Question Abstraction and Retrieval for Data-Scarce Semantic Parsing

Deep learning approaches to semantic parsing require a large amount of l...
research
05/07/2023

Laziness Is a Virtue When It Comes to Compositionality in Neural Semantic Parsing

Nearly all general-purpose neural semantic parsers generate logical form...
research
05/22/2023

The Bicomplex Tensor Product, a Bicomplex Choi Theorem and Applications

In this paper we extend the concept of tensor product to the bicomplex c...
research
03/10/2014

Parsing using a grammar of word association vectors

This paper was was first drafted in 2001 as a formalization of the syste...

Please sign up or login with your details

Forgot password? Click here to reset