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
Controlled natural language interfaces (extended abstract): the best of three worlds
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
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
Natural Language Processing for PROLOG Programmers
Natural Language Processing for PROLOG Programmers
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
Attempto Controlled English - Not Just Another Logic Specification Language
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Menu-based natural language understanding
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Discourse, anaphora and parsing
COLING '86 Proceedings of the 11th coference on Computational linguistics
From COGRAM to ALCOGRAM: toward a controlled English grammar checker
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
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
Involving Domain Experts in Authoring OWL Ontologies
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Journal of Computer and System Sciences
AceRules: executing rules in controlled natural language
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
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
Supporting developers with natural language queries
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
Implementing controlled languages in GF
CNL'09 Proceedings of the 2009 conference on Controlled natural language
SBVR's approach to controlled natural language
CNL'09 Proceedings of the 2009 conference on Controlled natural language
Writing clinical practice guidelines in controlled natural language
CNL'09 Proceedings of the 2009 conference on Controlled natural language
On controlled natural languages: properties and prospects
CNL'09 Proceedings of the 2009 conference on Controlled natural language
Parsing Techniques: A Practical Guide
Parsing Techniques: A Practical Guide
GINO – a guided input natural language ontology editor
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Codeco: a practical notation for controlled english grammars in predictive editors
CNL'10 Proceedings of the Second international conference on Controlled Natural Language
Hi-index | 0.00 |
Controlled natural languages (CNL) with a direct mapping to formal logic have been proposed to improve the usability of knowledge representation systems, query interfaces, and formal specifications. Predictive editors are a popular approach to solve the problem that CNLs are easy to read but hard to write. Such predictive editors need to be able to "look ahead" in order to show all possible continuations of a given unfinished sentence. Such lookahead features, however, are difficult to implement in a satisfying way with existing grammar frameworks, especially if the CNL supports complex nonlocal structures such as anaphoric references. Here, methods and algorithms are presented for a new grammar notation called Codeco, which is specifically designed for controlled natural languages and predictive editors. A parsing approach for Codeco based on an extended chart parsing algorithm is presented. A large subset of Attempto Controlled English has been represented in Codeco. Evaluation of this grammar and the parser implementation shows that the approach is practical, adequate and efficient.