메뉴 건너뛰기




Volumn , Issue , 2005, Pages 1004-1009

Viewing referring expression generation as search

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE GENERATION SYSTEMS; REFERRING EXPRESSIONS; SEARCH PROBLEM; SEMANTIC CONTENT;

EID: 84880739994     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (16)

References (18)
  • 2
    • 0040326797 scopus 로고    scopus 로고
    • Using Aggregation for Selecting Content when generating Referring Expressions
    • University of Marylad
    • J. Bateman. Using Aggregation for Selecting Content when generating Referring Expressions. In Proceedings of the 37th Annual Meeting of the ACL. University of Marylad, 1999.
    • (1999) Proceedings of the 37th Annual Meeting of the ACL
    • Bateman, J.1
  • 3
    • 37249054724 scopus 로고
    • Generating referring expressions involving relations
    • Berlin, Germany
    • R. Dale and N. Haddock. Generating referring expressions involving relations. In Proceedings of the 5th EACL, pages 161-166, Berlin, Germany, 1991.
    • (1991) Proceedings of the 5th EACL , pp. 161-166
    • Dale, R.1    Haddock, N.2
  • 4
    • 0003100354 scopus 로고
    • Computational interpretations of the gricean maxims in the generation of referring expressions
    • R. Dale and E. Reiter. Computational interpretations of the gricean maxims in the generation of referring expressions. Cognitive Science, 19(2):233-263, 1995.
    • (1995) Cognitive Science , vol.19 , Issue.2 , pp. 233-263
    • Dale, R.1    Reiter, E.2
  • 6
    • 84880721297 scopus 로고    scopus 로고
    • One-anaphora and the case for discourse-driven referring expression generation
    • University of Melbourne
    • R Dale. One-anaphora and the case for discourse-driven referring expression generation. In Proceedings of the Australasian Language Technology Workshop. University of Melbourne, 2003.
    • (2003) Proceedings of the Australasian Language Technology Workshop
    • Dale, R.1
  • 7
    • 85149146199 scopus 로고    scopus 로고
    • An Algorithm for Generating Referential Descriptions with Flexible Interfaces
    • University of Madrid
    • H. Horacek. An Algorithm for Generating Referential Descriptions with Flexible Interfaces. In Proceedings of the 35th Annual Meeting of the ACL. University of Madrid, 1997.
    • (1997) Proceedings of the 35th Annual Meeting of the ACL
    • Horacek, H.1
  • 8
    • 35048846576 scopus 로고    scopus 로고
    • On Referring toSets of Objects Naturally
    • H. Bunt and R.Muskens, editors, Springer-Verlag Heidelberg
    • H. Horacek. On Referring toSets of Objects Naturally. In H. Bunt and R.Muskens, editors, Third International Natural Language Generation Conference, pages 70-79. Springer-Verlag Heidelberg, 2004.
    • (2004) Third International Natural Language Generation Conference , pp. 70-79
    • Horacek, H.1
  • 10
    • 0042378596 scopus 로고    scopus 로고
    • Graph-based generation of referring expressions
    • DOI 10.1162/089120103321337430
    • E. Krahmer, S. van Erk, and A. Verleg. Graph-based generation of referring expressions. Computational Linguistics, 29(1):53-72, 2003. (Pubitemid 37049768)
    • (2003) Computational Linguistics , vol.29 , Issue.1 , pp. 53-72
    • Krahmer, E.1    Verleg, A.2    Van Erk, S.3
  • 12
    • 0011503890 scopus 로고
    • A fast algorithm for the generation of referring expressions
    • E. Reiter and R. Dale. A fast algorithm for the generation of referring expressions. In Proceedings of the 14th ACL, pages 232-238, 1992.
    • (1992) Proceedings of the 14th ACL , pp. 232-238
    • Reiter, E.1    Dale, R.2
  • 16
    • 41449097531 scopus 로고    scopus 로고
    • Graphs and booleans: On the generation of referring expressions
    • H. Bunt and R. Muskens, editors, Dordrecht: Kluwer, forthcoming
    • K. van Deemeter and E. Krahmer. Graphs and booleans: On the generation of referring expressions. In H. Bunt and R. Muskens, editors, Computing Meaning Vol. III . Dordrecht: Kluwer, forthcoming.
    • Computing Meaning , vol.3
    • Van Deemeter, K.1    Krahmer, E.2
  • 17
    • 0040671641 scopus 로고    scopus 로고
    • Generating referring expressions: Boolean extensions of the incremental algorithm
    • K. van Deemter. Generating referring expressions: Boolean extensions of the incremental algorithm. Computational Linguistics, 28(1):37-52, 2002.
    • (2002) Computational Linguistics , vol.28 , Issue.1 , pp. 37-52
    • Van Deemter, K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.