Graph-based generation of referring expressions

Computational Linguistics

Volumn 29, Issue 1, 2003, Pages 53-72

  Krahmer, Emiel ^a   Verleg, André ^b   Van Erk, Sebastiaan ^b  

^a TILBURG UNIVERSITY   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; DIRECTED GRAPHS; GRAPH STRUCTURES; GRAPHIC METHODS; STOCHASTIC SYSTEMS;

CONSTRUCTION PROBLEM; GENERATION ALGORITHM; GENERATION TECHNIQUES; GRAPH-BASED; NEW APPROACHES; REFERRING EXPRESSIONS; SEARCH PROCESS; STOCHASTIC APPROACH;

GRAPH ALGORITHMS;

EID: 0042378596     PISSN: 08912017     EISSN: None     Source Type: Journal    
DOI: 10.1162/089120103321337430     Document Type: Article

References (39)

1. Appelt, Douglas E. 1985. Planning English referring expressions. Artificial Intelligence, 26:1-33.
2. Bateman, John. 1997. Enabling technology for multilingual natural language generation: The KPML development environment. Natural Language Engineering, 3:15-55.
3. Bateman, John. 1999. Using aggregation for selecting content when generating referring expressions. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics (ACL'99), University of Maryland.
4. Bauckhage, Christian, Jannik Fritsch, Franz Kummert, and Gerhard Sagerer. 1999. Towards a vision system for supervising assembly processes. In Proceedings of the Symposium on Intelligent Robotic Systems (SIRS'99), pages 89-98.
5. Berge, Claude. 1985. Graphs. North-Holland, Amsterdam.
6. Blackburn, Patrick. 2000. Representation, reasoning, and relational structure: A hybrid logic manifesto. Logic Journal of the IGPL, 8(3):339-365.
7. Chartrand, Gary and Ortrud Oellermann. 1993. Applied and Algorithmic Graph Theory. McGraw-Hill, New York.
8. Cormen, Thomas H., Charles E. Leiserson, and Ronald L. Rivest. 1990. Introduction to Algorithms. MIT Press, Cambridge.
9. Dale, Robert. 1992. Generating Referring Expressions: Constructing Descriptions in a Domain of Objects and Processes. MIT Press, Cambridge.
10. Dale, Robert and Nicholas Haddock. 1991. Generating referring expressions involving relations. In Proceedings of the Fifth Conference of the European Chapter of the Association for Computational Linguistics (EACL'91), pages 161-166, Berlin.
11. Dale, Robert and Ehud Reiter. 1995. Computational interpretations of the Gricean maxims in the generation of referring expressions. Cognitive Science, 18:233-263.
12. Elhaded, Michael and Jacques Robin. 1997. SURGE: A comprehensive plug-in syntactic realization component for text generation. Technical Report 96-03, Computer Science Department, Ben-Gurion University, Beer Sheva, Israel.
13. Eppstein, David. 1999. Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms and Applications, 3(3):1-27.
14. Faugeras, Olivier. 1993. Three-Dimensional Computer Vision. MIT Press, Cambridge.
15. Garey, Michael R. and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York.
16. Gibbons, Alan M. 1985. Algorithmic Graph Theory. Cambridge University Press, Cambridge.
17. Grosz, Barbara J., Aravind K. Joshi, and Scott Weinstein. 1995. Centering: A framework for modeling the local coherence of discourse. Computational Linguistics, 21(2):203-225.
18. Hajičová, Eva. 1993. Issues of Sentence Structure and Discourse Patterns. Charles University, Prague.
19. Hopcroft, John E. and Robert Tarjan. 1974. Efficient planarity testing. Journal of the Association for Computing Machinery, 21:549-568.
20. Horacek, Helmut. 1997. An algorithm for generating referential descriptions with flexible interfaces. In Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics (ACL'97), pages 206-213, Madrid.
21. Krahmer, Emiel and Mariët Theune. 1998. Context sensitive generation of descriptions. In Proceedings of the Fifth International Conference on Spoken Language Processing (ICSLP'98), pages 1151-1154, Sydney.
22. Krahmer, Emiel and Mariët Theune. 2002. Efficient context-sensitive generation of descriptions. In Kees van Deemter and Rodger Kibble, editors, Information Sharing: Givenness and Newness in Language Processing. CSLI Publications, Stanford, California, pages 223-264.
23. Krahmer, Emiel, Sebastiaan van Erk, and André Verleg. 2001. A meta-algorithm for the generation of referring expressions. In Proceedings of the Eighth European Workshop on Natural Language Generation (EWNLG'01), Toulouse.
24. Langkilde, Irene and Kevin Knight. 1998. The practical value of n-grams in generation. In Proceedings of the Ninth International Workshop on Natural Language Generation (INLG'98), pages 248-255, Niagara-on-the-Lake, Ontario.
25. Liebers, Annegret. 2001. Planarizing graphs. Journal of Graph Algorithms and Applications, 5(1):1-74.
26. Malouf, Rob. 2000. The order of prenominal adjectives in natural language generation. In Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics (ACL'00), Hong Kong.
27. Messmer, Bruno T. and Horst Bunke. 1995. Subgraph isomorphism in polynomial time. Technical Report IAM 95-003, University of Bern, Institute of Computer Science and Applied Mathematics, Bern, Switzerland.
28. Messmer, Bruno T. and Horst Bunke. 1998. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(5):493-504.
29. Pechmann, Thomas. 1989. Incremental speech production and referential overspecification. Linguistics, 27:98-110.
30. Read, Ronald C. and Derek G. Corneil. 1977. The graph isomorphism disease. Journal of Graph Theory, 1(1):339-363.
31. Reiter, Ehud. 1990. The computational complexity of avoiding conversational implicatures. In Proceedings of the 28th Annual Meeting of the Association for Computational Linguistics (ACL'90), pages 97-104.
32. Rosch, Eleanor. 1978. Principles of categorization. In E. Rosch and B. Lloyd, editors, Cognition and Categorization. Lawrence Erlbaum, Hillsdale, New Jersey, pages 27-48.
33. Sedgewick, Robert. 1988. Algorithms. Addison-Wesley, Reading, Massachusetts, second edition.
34. Stone, Matthew and Bonnie Webber. 1998. Textual economy through close coupling of syntax and semantics. In Proceedings of the Ninth International Workshop on Natural Language Generation (INLG'98), pages 178-187, Niagara-on-the-Lake, Ontario.
35. Tarjan, Robert E. 1972. Depth-first search and linear time algorithms. SIAM Journal on Computing, 1(2):146-160.
36. Theune, Mariët. 2000. From Data to Speech: Language Generation in Context. Ph.D. thesis, Eindhoven University of Technology, Eindhoven, The Netherlands.
37. van Deemter, Kees. 2000. Generating vague descriptions. In Proceedings of the first International Natural Language Generation Conference (INLG'OO), Mitzpe Ramon.
38. van Deemter, Kees. 2002. Generating referring expressions: Boolean extensions of the incremental algorithm. Computational Linguistics, 28(1):37-52.
39. Wilson, Robin J. 1996. Introduction to Graph Theory. Longman, Harlow, England, fourth edition.