Weighted Semantic Parsing: A Robust Approach to Interpretation of Natural Language Queries

2001 ◽  
pp. 243-254
Author(s):  
Afzal Ballim ◽  
Vincenzo Pallotta
Keyword(s):  
Natural Language ◽  
Semantic Parsing ◽  
Robust Approach

scholarly journals Large-scale Semantic Parsing without Question-Answer Pairs

2014 ◽  
Vol 2 ◽  
pp. 377-392 ◽  
Author(s):  
Siva Reddy ◽  
Mirella Lapata ◽  
Mark Steedman
Keyword(s):  
Natural Language ◽  
Large Scale ◽  
Graph Matching ◽  
State Of The Art ◽  
The State ◽  
Semantic Parsing ◽  
Matching Problem ◽  
Weak Supervision ◽  
Benchmark Datasets

In this paper we introduce a novel semantic parsing approach to query Freebase in natural language without requiring manual annotations or question-answer pairs. Our key insight is to represent natural language via semantic graphs whose topology shares many commonalities with Freebase. Given this representation, we conceptualize semantic parsing as a graph matching problem. Our model converts sentences to semantic graphs using CCG and subsequently grounds them to Freebase guided by denotations as a form of weak supervision. Evaluation experiments on a subset of the Free917 and WebQuestions benchmark datasets show our semantic parser improves over the state of the art.

SEMANTIC-PARSING BASED ON SEMANTIC UNITS THEORY — A NEW APPROACH TO NATURAL LANGUAGES PROCESSING

2008 ◽  
Vol 22 (07) ◽  
pp. 1447-1459 ◽  
Author(s):  
XIAOYU GAO ◽  
HU YUE ◽  
L. LI ◽  
QINGSHI GAO
Keyword(s):  
Natural Language ◽  
Semantic Parsing ◽  
Natural Languages ◽  
New Approach ◽  
Sentence Parsing ◽  
Syntax Parsing ◽  
Parsing Tree

The syntax of different natural languages are different, hence the parsing of different natural languages are also different, thus leadings to structures of their parsing-trees being different. The reason that the sentences in different natural languages can be translated to each other is that they have the same meaning. This paper discusses a new sentence parsing, called semantic-parsing, based on semantic units theory. It is a new theory where a sentence of a natural language is not regarded as of words and phrases arranged linearly; rather it is expected to consist of semantic units with or without type-parameters. This is a new parsing approach where the syntax-parsing-tree and semantic-parsing-tree are isomorphic. It is also a new approach in which the structure-trees of the sentences in all different natural languages can correspond.

scholarly journals Learning Structured Natural Language Representations for Semantic Parsing

2017 ◽  
Author(s):  
Jianpeng Cheng ◽  
Siva Reddy ◽  
Vijay Saraswat ◽  
Mirella Lapata
Keyword(s):  
Natural Language ◽  
Semantic Parsing

scholarly journals Menu-Gestuurde 'Natuurlijke Taal' Interfaces voor Intelligente Onderwijssystemen

1994 ◽  
Vol 49 ◽  
pp. 27-44
Author(s):  
Gellof Kanselaar ◽  
Gijsbert Erkens
Keyword(s):  
Problem Solving ◽  
Natural Language ◽  
Information Exchange ◽  
Computer Assisted ◽  
Semantic Parsing ◽  
Typing Skill ◽  
Natural Language Interface ◽  
Dialogue Structure ◽  
First Results ◽  
Actual Interaction

In the DSA-project (Analysis of Dialogue Structure in interactive problem solving) we are studying the relationship between the cognitive aspects of information processing and the communicative process of information exchange during cooperative problem solving. On the basis of analyses of task-dialogues a prototype of a 'Dialogue Monitor' for an "Intelligent" Cooperative System has been implemented. The monitor is the central part of a computer-assisted educational program that 'thinks along' with the student and cooperates in jointly solving a problem task. For the actual interaction with this prototype a menu-based 'natural language' interface has been constructed. By means of interconnected menus the student can select constituents of the utterance he/she wants to create. The interface translates the selections made by the students into 'natural language' (Dutch) sentences. The advantages of this kind of interface are obvious: no ambivalent semantic parsing and no typing skill is required. Furthermore, the interface is very flexible and relatively easy to use. With the interface a large number of different sentences can be constructed (about 3.2 million). The 'Dialogue Monitor' programme has been used experimentally with students (10-12 years old) of two elementary schools. Prerequisites and methods for constructing a menu-based 'natural language' interface are discussed in this article. The first results of students using the interface will be reported.

scholarly journals A New Corpus and Imitation Learning Framework for Context-Dependent Semantic Parsing

2014 ◽  
Vol 2 ◽  
pp. 547-560 ◽  
Author(s):  
Andreas Vlachos ◽  
Stephen Clark
Keyword(s):  
Information System ◽  
Natural Language ◽  
Learning Algorithm ◽  
Imitation Learning ◽  
Semantic Parsing ◽  
Learning Framework ◽  
Test Sets ◽  
Context Dependent ◽  
Meaning Representation ◽  
Tourist Information

Semantic parsing is the task of translating natural language utterances into a machine-interpretable meaning representation. Most approaches to this task have been evaluated on a small number of existing corpora which assume that all utterances must be interpreted according to a database and typically ignore context. In this paper we present a new, publicly available corpus for context-dependent semantic parsing. The MRL used for the annotation was designed to support a portable, interactive tourist information system. We develop a semantic parser for this corpus by adapting the imitation learning algorithm DAgger without requiring alignment information during training. DAgger improves upon independently trained classifiers by 9.0 and 4.8 points in F-score on the development and test sets respectively.

scholarly journals Semantic Parsing of Ambiguous Input through Paraphrasing and Verification

2015 ◽  
Vol 3 ◽  
pp. 571-584
Author(s):  
Philip Arthur ◽  
Graham Neubig ◽  
Sakriani Sakti ◽  
Tomoki Toda ◽  
Satoshi Nakamura
Keyword(s):  
Natural Language ◽  
Language Model ◽  
Input String ◽  
New Method ◽  
Semantic Parsing ◽  
Search Queries ◽  
Input Sentence ◽  
Meaning Representation ◽  
Context Free ◽  
Do So

We propose a new method for semantic parsing of ambiguous and ungrammatical input, such as search queries. We do so by building on an existing semantic parsing framework that uses synchronous context free grammars (SCFG) to jointly model the input sentence and output meaning representation. We generalize this SCFG framework to allow not one, but multiple outputs. Using this formalism, we construct a grammar that takes an ambiguous input string and jointly maps it into both a meaning representation and a natural language paraphrase that is less ambiguous than the original input. This paraphrase can be used to disambiguate the meaning representation via verification using a language model that calculates the probability of each paraphrase.

scholarly journals Natural Hoare Logic: Towards formal verification of programs from logical forms of natural language specifications

2021 ◽  
Author(s):  
Jayaraj Poroor
Keyword(s):  
Natural Language ◽  
Formal Verification ◽  
Domain Knowledge ◽  
Semantic Content ◽  
Hoare Logic ◽  
Critical Systems ◽  
Semantic Parsing ◽  
Natural Language Text ◽  
Safety Requirements ◽  
Formal Framework

Formal verification provides strong guarantees of correctness of software, which are especially important in safety or security critical systems. Hoare logic is a widely used formalism for rigorous verification of software against specifications in the form of pre-condition/post-condition assertions. The advancement of semantic parsing techniques and higher computational capabilities enable us to extract semantic content from natural language text as formal logical forms, with increasing accuracy and coverage. This paper proposes a formal framework for Hoare logic-based formal verification of imperative programs using logical forms generated from compositional semantic parsing of natural language assertions. We call our reasoning approach Natural Hoare Logic. This enables formal verification of software directly against safety requirements specified by a domain expert in natural language. We consider both declarative assertions of program invariants and state change as well as imperative assertions that specify commands which alter the program state. We discuss how the reasoning approach can be extended using domain knowledge and a practical approach for guarding against semantic parser errors.

Sign in / Sign up

Export Citation Format

Share Document