메뉴 건너뛰기




Volumn 2002-July, Issue , 2002, Pages 96-103

Generating minimal definite descriptions

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT-BASED; DEFINITE DESCRIPTIONS; INCREMENTAL ALGORITHM; POSITIVE/NEGATIVE; PROPERTY; RELATED ALGORITHMS;

EID: 10044289010     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (65)

References (12)
  • 1
    • 84990556339 scopus 로고
    • Content determination in the generation of referring expressions
    • R. Dale and N. Haddock. 1991. Content determination in the generation of referring expressions. Computational Intelligence, 7(4):252-265.
    • (1991) Computational Intelligence , vol.7 , Issue.4 , pp. 252-265
    • Dale, R.1    Haddock, N.2
  • 2
    • 0003100354 scopus 로고
    • Computational interpretations of the gricean maxims in the generation of referring expressions
    • R. Dale and E. Reiter. 1995. Computational interpretations of the gricean maxims in the generation of referring expressions. Cognitive Science, 18:233-263.
    • (1995) Cognitive Science , vol.18 , pp. 233-263
    • Dale, R.1    Reiter, E.2
  • 7
    • 85149133367 scopus 로고    scopus 로고
    • Programming Systems Lab Saarbrücken. OzWebpage
    • Programming Systems Lab Saarbrücken. 1998. OzWebpage: http://www.ps.uni-sb.de/oz/.
    • (1998)
  • 12
    • 85149149338 scopus 로고    scopus 로고
    • Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
    • To appear in Computational Linguistics
    • K. van Deemter. 2001. Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm. To appear in Computational Linguistics.
    • (2001)
    • van Deemter, K.1


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