Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Efficient decoration of parse forests
Feature formalisms and linguistic ambiguity
Godel, Escher, Bach: An Eternal Golden Braid
Godel, Escher, Bach: An Eternal Golden Braid
Affix Grammars for Programming Languages
Proceedings on Attribute Grammars, Applications and Systems
Usability and portability of a compiler writing system
Symposium on Methods of Algorithmic Language Implementation
A formalised technique for expressing compiler exercisers
ACM SIGPLAN Notices
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Some chart-based techniques for parsing ill-formed input
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Unification of disjunctive feature descriptions
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Software support for practical grammar development
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Automatic generation of random self-checking test cases
IBM Systems Journal
Context-free parsing through regular approximation
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Comparing the performance of two TAG-based surface realisers using controlled grammar traversal
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Using regular tree grammars to enhance sentence realisation
Natural Language Engineering
| Hi-index | 0.00 |
We discuss the random generation of strings using the grammatical formalism AGFL. This formalism consists of context-free grammars extended with a parameter mechanism, where the parameters range over a finite domain. Our approach consists in static analysis of the combinations of parameter values with which derivations can be constructed. After this analysis, generation of sentences can be performed without backtracking.