No abstract available.
Cited By
- Rubinoff R (2000). Integrating text planning and linguistic choice without abandoning modularity, Computational Linguistics, 26:2, (107-138), Online publication date: 1-Jun-2000.
- Reiter E (2000). Pipelines and size constraints, Computational Linguistics, 26:2, (251-259), Online publication date: 1-Jun-2000.
- Amsili P and Rossari C Tense and connective constraints on the expression of causality Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 1, (48-54)
- Elhadad M, Robin J and McKeown K (1997). Floating constraints in lexical choice, Computational Linguistics, 23:2, (195-239), Online publication date: 1-Jun-1997.
- Knight K and Hatzivassiloglou V Two-level, many-paths generation Proceedings of the 33rd annual meeting on Association for Computational Linguistics, (252-260)
- Hoffman B Generating context-appropriate word orders in Turkish Proceedings of the Seventh International Workshop on Natural Language Generation, (117-126)
- Panaget F Using a textual representational level component in the context of discourse or dialogue generation Proceedings of the Seventh International Workshop on Natural Language Generation, (127-136)
- Wanner L Building another bridge over the generation gap Proceedings of the Seventh International Workshop on Natural Language Generation, (137-144)
- McKeown K, Robin J and Tanenblatt M Tailoring lexical choice to the user's vocabulary in multimedia explanation generation Proceedings of the 31st annual meeting on Association for Computational Linguistics, (226-234)
- Smith R, Hipp D and Biermann A A dialog control algorithm and its performance Proceedings of the third conference on Applied natural language processing, (9-16)
- Smadja F and McKeown K Automatically extracting and representing collocations for language generation Proceedings of the 28th annual meeting on Association for Computational Linguistics, (252-259)
- Emele M, Heid U, Momma S and Zajac R Organizing linguistic knowledge for multilingual generation Proceedings of the 13th conference on Computational linguistics - Volume 3, (102-107)
- Namer F Subject erasing and pronominalization in Italian text generation Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics, (225-232)
- Danlos L and Namer F Morphology and cross dependencies in the synthesis of personal pronouns in Romance languages Proceedings of the 12th conference on Computational linguistics - Volume 1, (139-141)
- Lancel J, Otani M, Simonin N and Danlos L SAGE Proceedings of the 12th conference on Computational linguistics - Volume 1, (359-364)
- Pustejovsky J and Anick P On the semantic interpretation of nominals Proceedings of the 12th conference on Computational linguistics - Volume 2, (518-523)
- Ward N Issues in word choice Proceedings of the 12th conference on Computational linguistics - Volume 2, (726-731)
- Danlos L, Laporte E and Emerard F Synthesis of spoken messages from semantic representations Proceedings of the 11th coference on Computational linguistics, (599-604)
Recommendations
The linguistic string parser
AFIPS '73: Proceedings of the June 4-8, 1973, national computer conference and expositionThe linguistic string parser is a system for the syntactic analysis of English scientific text. This system, now in its third version, has been developed over the past 8 years by the Linguistic String Project of New York University. The structure of the ...
Automatic comma insertion for Japanese text generation
EMNLP '10: Proceedings of the 2010 Conference on Empirical Methods in Natural Language ProcessingThis paper proposes a method for automatically inserting commas into Japanese texts. In Japanese sentences, commas play an important role in explicitly separating the constituents, such as words and phrases, of a sentence. The method can be used as an ...
Lfg generation by grammar specialization
This article describes an approach to Lexical-Functional Grammar LFG generation that is based on the fact that the set of strings that an LFG grammar relates to a particular acyclic f-structure is a context-free language. We present an algorithm that ...