Introduction to Formal Language Theory
Introduction to Formal Language Theory
Balanced Grammars and Their Languages
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Semantically-based text authoring and the concurrent documentation of experimental protocols
Proceedings of the 2003 ACM symposium on Document engineering
Handling syntactic constraints in a DTD-compliant XML editor
Proceedings of the 2003 ACM symposium on Document engineering
Journal of Functional Programming
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
XML and multilingual document authoring: convergent trends
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Text authoring, knowledge acquisition and description logics
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Document structure and multilingual authoring
INLG '00 Proceedings of the first international conference on Natural language generation - Volume 14
| Hi-index | 0.00 |
We present an approach to controlled document authoring that significantly extends the functionality of existing methods by allowing bottom-up and top-down specifications to be freely mixed. A finite-state automaton is used to represent the partial, evolving, description of the document during authoring. Using a generalization of chart-parsing techniques to FSAs rather than fixed input strings, we show how the authoring system is able to automatically detect the consequences of the choices already made by the author so as to only propose for the next authoring steps choices which may provably lead to a globally valid document. We start by considering the case of authoring purely textual documents controlled by a context-free grammar, then show a generalization of this approach to structured documents controlled by a specification whose formal expressive power is at least that of Regular Hedge Grammars (closely related to RELAX NG Schemas) and therefore greater than that of DTDs.