메뉴 건너뛰기




Volumn , Issue , 2009, Pages 261-264

From extractive to abstractive meeting summaries: Can it be done by sentence compression?

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSION ALGORITHMS; EXTRACTIVE SUMMARIZATIONS; GRAMMAR RULES; INTEGER LINEAR PROGRAMMING; LANGUAGE GENERATION; NOISY CHANNEL; SENTENCE COMPRESSION; PERFORMANCE;

EID: 77955419671     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (54)

References (17)
  • 1
    • 77949382114 scopus 로고    scopus 로고
    • Automatic summarization of meeting data: A feasibility study
    • A. Buist, W. Kraaij, and S. Raaijmakers. 2005. Automatic summarization of meeting data: A feasibility study. In Proc. of CLIN.
    • (2005) Proc. of CLIN
    • Buist, A.1    Kraaij, W.2    Raaijmakers, S.3
  • 2
    • 85120620835 scopus 로고    scopus 로고
    • Edit detection and parsing for transcribed speech
    • E. Charniak and M. Johnson. 2001. Edit detection and parsing for transcribed speech. In Proc. of NAACL.
    • (2001) Proc. of NAACL
    • Charniak, E.1    Johnson, M.2
  • 3
    • 44449150380 scopus 로고    scopus 로고
    • Global inference for sentence compression: An integer linear programming approach
    • J. Clarke and M. Lapata. 2008. Global inference for sentence compression: An integer linear programming approach. Journal of Artificial Intelligence Research, 31:399-429.
    • (2008) Journal of Artificial Intelligence Research , vol.31 , pp. 399-429
    • Clarke, J.1    Lapata, M.2
  • 5
    • 77956328274 scopus 로고    scopus 로고
    • Lexicalized markov grammars for sentence compression
    • M. Galley and K. McKeown. 2007. Lexicalized markov grammars for sentence compression. In Proc. of NAACL/HLT.
    • Proc. of NAACL/HLT , pp. 2007
    • Galley, M.1    McKeown, K.2
  • 6
    • 80053378624 scopus 로고    scopus 로고
    • A skip-chain conditional random field for ranking meeting utterances by importance
    • M. Galley. 2006. A skip-chain conditional random field for ranking meeting utterances by importance. In Proc. of EMNLP.
    • (2006) Proc. of EMNLP
    • Galley, M.1
  • 10
    • 0036641584 scopus 로고    scopus 로고
    • Summarization beyond sentence extraction: A probabilistic approach to sentence compression
    • K. Knight and D. Marcu. 2002. Summarization beyond sentence extraction: A probabilistic approach to sentence compression. Artificial Intelligence, 139:91-107.
    • (2002) Artificial Intelligence , vol.139 , pp. 91-107
    • Knight, K.1    Marcu, D.2
  • 12
    • 84939172953 scopus 로고    scopus 로고
    • Summarizing speech without text using hidden markov models
    • S. Maskey and J. Hirschberg. 2006. Summarizing speech without text using hidden markov models. In Proc. of HLT/NAACL.
    • (2006) Proc. of HLT/NAACL
    • Maskey, S.1    Hirschberg, J.2
  • 16
    • 84859919694 scopus 로고    scopus 로고
    • Supervised and unsupervised learning for sentence compression
    • J. Turner and E. Charniak. 2005. Supervised and unsupervised learning for sentence compression. In Proc. of ACL.
    • (2005) Proc. of ACL
    • Turner, J.1    Charniak, E.2
  • 17


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