Procedure for quantitatively comparing the syntactic coverage of English grammars
HLT '91 Proceedings of the workshop on Speech and Natural Language
Feature structures based Tree Adjoining Grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Toward an engineering discipline for grammarware
ACM Transactions on Software Engineering and Methodology (TOSEM)
An algebra for semantic construction in constraint-based grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Error mining for wide-coverage grammar engineering
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Error mining in parsing results
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Spotting overgeneration suspects
ENLG '07 Proceedings of the Eleventh European Workshop on Natural Language Generation
Evaluating coverage for large symbolic NLG grammars
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A generalized method for iterative error mining in parsing results
GEAF '09 Proceedings of the 2009 Workshop on Grammar Engineering Across Frameworks
Using regular tree grammars to enhance sentence realisation
Natural Language Engineering
The first surface realisation shared task: overview and evaluation results
ENLG '11 Proceedings of the 13th European Workshop on Natural Language Generation
Error mining on dependency trees
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Proceedings of the Seventh Workshop on Building Educational Applications Using NLP
| Hi-index | 0.00 |
While in Computer Science, grammar engineering has led to the development of various tools for checking grammar coherence, completion, under- and over-generation, in Natural Langage Processing, most approaches developed to improve a grammar have focused on detecting under-generation and to a much lesser extent, over-generation. We argue that generation can be exploited to address other issues that are relevant to grammar engineering such as in particular, detecting grammar incompleteness, identifying sources of over-generation and analysing the linguistic coverage of the grammar. We present an algorithm that implements these functionalities and we report on experiments using this algorithm to analyse a Feature-Based Lexicalised Tree Adjoining Grammar consisting of roughly 1500 elementary trees.