메뉴 건너뛰기




Volumn 2276, Issue , 2002, Pages 360-369

Answer extraction in technical domains

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; TEXT PROCESSING;

EID: 84957693308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45715-1_37     Document Type: Conference Paper
Times cited : (1)

References (28)
  • 3
    • 0002902135 scopus 로고
    • A rule-based approach to prepositional phrase attachment disambiguation
    • Kyoto, Japan
    • Eric Brill and Philip Resnik. A rule-based approach to prepositional phrase attachment disambiguation. In Proc. COLING '94, volume 2, pages 998-1004, Kyoto, Japan, 1994.
    • (1994) Proc. COLING '94 , pp. 998-1004
    • Brill, E.1    Resnik, P.2
  • 6
    • 0003892665 scopus 로고    scopus 로고
    • Minimal recursion semantics: An introduction
    • CSLI, Stanford University, Stanford, CA
    • Ann Copestake, Dan Flickinger, and Ivan A. Sag. Minimal recursion semantics: an introduction. Technical report, CSLI, Stanford University, Stanford, CA, 1997.
    • (1997) Technical report
    • Copestake, A.1    Flickinger, D.2    Sag, I.A.3
  • 10
    • 26444508466 scopus 로고
    • A very fast prototype retrieval using statistical ranking
    • Donna K. Harman and Gerald T. Candela. A very fast prototype retrieval using statistical ranking. SIGIR Forum, 23(3/4): 100-110, 1989.
    • (1989) SIGIR Forum , vol.23 , Issue.3-4 , pp. 100-110
    • Harman, D.K.1    Candela, G.T.2
  • 12
    • 85149152839 scopus 로고
    • Ontological promiscuity
    • University of Chicago, Association for Computational Linguistics
    • Jerry R. Hobbs. Ontological promiscuity. In Proc. ACL’85, pages 61-69. University of Chicago, Association for Computational Linguistics, 1985.
    • (1985) Proc. ACL’85 , pp. 61-69
    • Hobbs, J.R.1
  • 16
    • 30844441070 scopus 로고
    • An algorithm for pronominal anaphora resolution
    • Shalom Lappin and Herbert J. Leass. An algorithm for pronominal anaphora resolution. Computational Linguistics, 20(4): 535-561, 1994.
    • (1994) Computational Linguistics , vol.20 , Issue.4 , pp. 535-561
    • Lappin, S.1    Leass, H.J.2
  • 17
    • 0029410109 scopus 로고
    • Cyc: A large-scale investment in knowledge infrastructure
    • D. B. Lenat. Cyc: A large-scale investment in knowledge infrastructure. Communications of the ACM, 11, 1995.
    • (1995) Communications of the ACM , vol.11
    • Lenat, D.B.1
  • 20
    • 84957619925 scopus 로고    scopus 로고
    • ExtrAns: An answer extraction system for unix manpages - On-line manual
    • Computational Linguistics, University of Zurich
    • Diego Mollá. ExtrAns: An answer extraction system for unix manpages - on-line manual. Technical report, Computational Linguistics, University of Zurich, 1998. http://www.ifi.unizh.ch/CL/.
    • (1998) Technical report
    • Mollá, D.1
  • 24
    • 84957626663 scopus 로고    scopus 로고
    • Inkrementelle minimale logische formen für die antwortextraktion. 1999
    • University of Mainz, FASK, September 7-10
    • Gerold Schneider, Diego Mollá Aliod, and Michael Hess. Inkrementelle minimale logische formen für die antwortextraktion. 1999. Proceedings of 4th Linguistic Colloquium, University of Mainz, FASK, September 7-10, 1999.
    • (1999) Proceedings of 4th Linguistic Colloquium
    • Schneider, G.1    Aliod, D.M.2    Hess, M.3
  • 28


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