Working for Two: A Bidirectional Grammar for a Controlled Natural Language

Authors:
Rolf Schwitter
Affiliations:
Centre for Language Technology, Macquarie University, Sydney, Australia NSW 2109
Venue:
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Year:
2008

Citing 6
Cited 0

PROLOG and Natural Language Analysis

PROLOG and Natural Language Analysis
The TPTP Problem Library

Journal of Automated Reasoning
English as a Formal Specification Language

DEXA '02 Proceedings of the 13th International Workshop on Database and Expert Systems Applications
Attempto Controlled English - Not Just Another Logic Specification Language

LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Talk to Your Semantic Web

IEEE Internet Computing
Attempto Controlled English for Knowledge Representation

Reasoning Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces the controlled natural language PENG Light together with a language processor that is based on a bidirectional grammar. The language processor has the following interesting properties: (a) it translates declarative sentences written in PENG Light into a first-order logic notation (TPTP); (b) it generates declarative sentences in PENG Light taking syntactically annotated TPTP formulas as input; and (c) it translates questions written in PENG Light into (conjunctive) queries in TPTP notation and uses the TPTP representation of the query as a starting point for generating answers in PENG Light. Moreover, the controlled natural language processor can be interfaced directly with an automated reasoner in order to resolve anaphoric references and to answer questions stated in PENG Light.