Definite clause grammars for language analysis
Readings in natural language processing
An algorithm for pronominal anaphora resolution
Computational Linguistics
Survey of the state of the art in human language technology
Survey of the state of the art in human language technology
An efficient context-free parsing algorithm
Communications of the ACM
backus normal form vs. Backus Naur form
Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
Knowledge Representation in CGLF, CGIF, KIF, Frame-CG and Formalized-English
ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
Capturing and answering questions posed to a knowledge-based system
Proceedings of the 4th international conference on Knowledge capture
Attempto Controlled English for Knowledge Representation
Reasoning Web
Journal of Computer and System Sciences
CLOnE: controlled language for ontology editing
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Implementing controlled languages in GF
CNL'09 Proceedings of the 2009 conference on Controlled natural language
A Principled Approach to Grammars for Controlled Natural Languages and Predictive Editors
Journal of Logic, Language and Information
| Hi-index | 0.00 |
This paper introduces a new grammar notation, called Codeco, designed for controlled natural language (CNL) and predictive editors. Existing grammar frameworks that target either formal or natural languages do not work out particularly well for CNL, especially if they are to be used in predictive editors and if anaphoric references should be resolved in a deterministic way. It is not trivial to build predictive editors that can precisely determine which anaphoric references are possible at a certain position. This paper shows how such complex structures can be represented in Codeco, a novel grammar notation for CNL. Two different parsers have been implemented (one in Prolog and another one in Java) and a large subset of Attempto Controlled English (ACE) has been represented in Codeco. The results show that Codeco is practical, adequate and efficient.