An annotation scheme for free word order languages
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Separating surface order and syntactic relations in a dependency grammar
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Converting dependency structures to phrase structures
HLT '01 Proceedings of the first international conference on Human language technology research
Topological dependency trees: a constraint-based account of linear precedence
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Word order in German: a formal dependency grammar using a topological hierarchy
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
On using a parallel graph rewriting formalism in generation
EWNLG '01 Proceedings of the 8th European workshop on Natural Language Generation - Volume 8
Broad coverage multilingual deep sentence generation with a stochastic multi-level realizer
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Generating non-projective word order in statistical linearization
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Hi-index | 0.00 |
Determining the word order in free word order languages is deemed as a challenge for NLG. In this paper, we propose a simple approach in order to get the appropriate grammatically correct variants of a sentence using a dependency structure as input. We describe a linearization grammar based on a graph grammar that allows to retrieve a topological model using unordered constituent structures and precedence relations. The graph grammar formalism is totally language independent and only the grammar depends on the language. The grammar rules can be automatically acquired from a corpus that is annotated with phrase structures and dependency structures. The dependency structures annotation is retrieved by structure translation from the phrase structure annotation. We conclude with the description of a grammar and the evaluation of the formalism using a large corpus.