The syntactic process
Ambiguity management in natural language generation
Ambiguity management in natural language generation
Recognizing syntactic errors in the writing of second language learners
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Sensitive parsing: error analysis and explanation in an intelligent language tutoring system
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Coupling CCG and hybrid logic dependency semantics
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Discriminative language modeling with conditional random fields and the perceptron algorithm
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Robust PCFG-based generation using automatically acquired LFG approximations
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Hierarchical Phrase-Based Translation
Computational Linguistics
CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank
Computational Linguistics
Wide-coverage efficient statistical parsing with ccg and log-linear models
Computational Linguistics
Dependency-based n-gram models for general purpose sentence realisation
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Exploiting named entity classes in CCG surface realization
NAACL-Short '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers
Sentence realisation from bag of words with dependency constraints
SRWS '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Student Research Workshop and Doctoral Consortium
Probabilistic models for disambiguation of an HPSG-based chart generator
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Perceptron reranking for CCG realization
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1
CCG chart realization from disjunctive inputs
INLG '06 Proceedings of the Fourth International Natural Language Generation Conference
A Linguistically Inspired Statistical Model for Chinese Punctuation Generation
ACM Transactions on Asian Language Information Processing (TALIP)
Designing agreement features for realization ranking
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
High efficiency realization for a wide-coverage unification grammar
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
The OSU system for surface realization at Generation Challenges 2011
ENLG '11 Proceedings of the 13th European Workshop on Natural Language Generation
| Hi-index | 0.00 |
This paper shows how glue rules can be used to increase the robustness of statistical chart realization in a manner inspired by dependency realization. Unlike the use of glue rules in MT---but like previous work with XLE on improving robustness with hand-crafted grammars---they are invoked here as a fall-back option when no grammatically complete realization can be found. The method works with Combinatory Categorial Grammar (CCG) and has been implemented in OpenCCG. As the techniques are not overly tied to CCG, they are expected to be applicable to other grammar-based chart realizers where robustness is a common problem. Unlike an earlier robustness technique of greedily assembling fragments, glue rules enable n-best outputs and are compatible with disjunctive inputs. Experimental results indicate that glue rules yield improved realizations in comparison to greedy fragment assembly, though a sizeable gap remains between the quality of grammatically complete realizations and fragmentary ones.