메뉴 건너뛰기




Volumn 3123, Issue , 2004, Pages 171-181

Overgenerating referring expressions involving relations and booleans

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

EID: 35048826741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27823-8_18     Document Type: Article
Times cited : (2)

References (16)
  • 1
    • 0012076618 scopus 로고    scopus 로고
    • Exploiting a probabilistic hierarchical model for generation
    • Bangalore, S., Rambow, O. 2000: Exploiting a probabilistic hierarchical model for generation. Proceedings of COLING-00.
    • (2000) Proceedings of COLING-00
    • Bangalore, S.1    Rambow, O.2
  • 2
    • 37249054724 scopus 로고
    • Generating referring expressions involving relations
    • Dale, R., Haddock, N. 1991: Generating referring expressions involving relations. Proceedings of EACL-91.
    • (1991) Proceedings of EACL-91.
    • Dale, R.1    Haddock, N.2
  • 3
    • 0003100354 scopus 로고
    • Computational interpretations of the gricean maxims in the generation of referring expressions
    • Dale, R., Reiter, E. 1995: Computational interpretations of the gricean maxims in the generation of referring expressions. Cognitive Science, 19:233-263.
    • (1995) Cognitive Science , vol.19 , pp. 233-263
    • Dale, R.1    Reiter, E.2
  • 5
    • 10044289010 scopus 로고    scopus 로고
    • Generating minimal definite descriptions
    • Gardent, C. 2002: Generating minimal definite descriptions. Proceedings of ACL-02.
    • (2002) Proceedings of ACL-02
    • Gardent, C.1
  • 6
    • 0041167336 scopus 로고    scopus 로고
    • A principled representation of attributive descriptions for generating integrated text and information graphics presentations
    • Green, N., Carenini, G., Moore, J. 1998: A principled representation of attributive descriptions for generating integrated text and information graphics presentations. Proceedings of IWNLG-98.
    • (1998) Proceedings of IWNLG-98
    • Green, N.1    Carenini, G.2    Moore, J.3
  • 7
    • 35048825183 scopus 로고    scopus 로고
    • A best-first search algorithm for generating referring expression
    • research notes
    • Horacek, H. 2003: A best-first search algorithm for generating referring expression. Proceedings of EACL-03 (research notes).
    • (2003) Proceedings of EACL-03
    • Horacek, H.1
  • 9
    • 0042378596 scopus 로고    scopus 로고
    • Graph-based generation of referring expressions
    • Krahmer, E., Verleg, A., van Erk, S. 2003: Graph-based generation of referring expressions. Computational Linguistics, 29(1):53-72.
    • (2003) Computational Linguistics , vol.29 , Issue.1 , pp. 53-72
    • Krahmer, E.1    Verleg, A.2    Van Erk, S.3
  • 12
    • 85149146014 scopus 로고    scopus 로고
    • Sentence planning as description using Tree-Adjoining Grammar
    • Stone, M., Doran, C. 1997: Sentence planning as description using Tree-Adjoining Grammar. Proceedings of ACL-97.
    • (1997) Proceedings of ACL-97
    • Stone, M.1    Doran, C.2
  • 13
    • 0040671641 scopus 로고    scopus 로고
    • Generating referring expressions: Boolean extensions of the incremental algorithm
    • van Deemter, K. 2002: Generating referring expressions: Boolean extensions of the incremental algorithm. Computational Linguistics, 28(1):37-52.
    • (2002) Computational Linguistics , vol.28 , Issue.1 , pp. 37-52
    • Van Deemter, K.1
  • 16
    • 35048829234 scopus 로고    scopus 로고
    • Reversible delayed lexical choice in a bidirectional framework
    • Wilcock, G. and Matsumoto, Y. 1996: Reversible delayed lexical choice in a bidirectional framework. COLING-96.
    • (1996) COLING-96
    • Wilcock, G.1    Matsumoto, Y.2


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