메뉴 건너뛰기




Volumn , Issue , 2009, Pages 391-399

A comparison of model free versus model intensive approaches to sentence compression

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

EID: 77956321236     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1699510.1699562     Document Type: Conference Paper
Times cited : (19)

References (21)
  • 1
    • 84860530953 scopus 로고    scopus 로고
    • Models for sentence compression: A comparison across domains, training requirements and evaluation measures
    • Sydney, Australia, July
    • James Clarke and Mirella Lapata. 2006. Models for sentence compression: A comparison across domains, training requirements and evaluation measures. In Proceedings of the 21st COLING and 44th ACL, pages 377-384, Sydney, Australia, July.
    • (2006) Proceedings of the 21st COLING and 44th ACL , pp. 377-384
    • Clarke, J.1    Lapata, M.2
  • 2
    • 11144240583 scopus 로고    scopus 로고
    • A comparison of string distance metrics for name-matching tasks
    • Subbarao Kambhampati and Craig A. Knoblock, editors
    • William W. Cohen, Pradeep Ravikumar, and Stephen E. Fienberg. 2003. A comparison of string distance metrics for name-matching tasks. In Subbarao Kambhampati and Craig A. Knoblock, editors, IIWeb, pages 73-78.
    • (2003) IIWeb , pp. 73-78
    • Cohen, W.W.1    Ravikumar, P.2    Fienberg, S.E.3
  • 3
    • 57349171524 scopus 로고    scopus 로고
    • Large margin synchronous generation and its application to sentence compression
    • Prague, Czech Republic, June
    • Trevor Cohn and Mirella Lapata. 2007. Large margin synchronous generation and its application to sentence compression. In Proceedings of the 2007 EMNLP-CoNLL, pages 73-82, Prague, Czech Republic, June.
    • (2007) Proceedings of the 2007 EMNLP-CoNLL , pp. 73-82
    • Cohn, T.1    Lapata, M.2
  • 4
    • 80053387988 scopus 로고    scopus 로고
    • Sentence compression beyond word deletion
    • Manchester, UK, August
    • Trevor Cohn and Mirella Lapata. 2008. Sentence compression beyond word deletion. In Proceedings of the 22nd COLING, pages 137-144, Manchester, UK, August.
    • (2008) Proceedings of the 22nd COLING , pp. 137-144
    • Cohn, T.1    Lapata, M.2
  • 7
    • 85037338954 scopus 로고    scopus 로고
    • Generating typed dependency parses from phrase structure parses
    • Marie-Catherine de Marneffe, Bill MacCartney, and Christopher D. Manning. 2006. Generating typed dependency parses from phrase structure parses. In LREC 2006.
    • (2006) LREC 2006
    • De Marneffe, M.-C.1    MacCartney, B.2    Manning, C.D.3
  • 8
    • 35448957236 scopus 로고    scopus 로고
    • Generating constituent order in german clauses
    • Prague, Czech Republic, June
    • Katja Filippova and Michael Strube. 2007. Generating constituent order in german clauses. In Proceedings of the 45th ACL, pages 320-327, Prague, Czech Republic, June.
    • (2007) Proceedings of the 45th ACL , pp. 320-327
    • Filippova, K.1    Strube, M.2
  • 9
    • 77956313019 scopus 로고    scopus 로고
    • Sentence fusion via dependency graph compression
    • Honolulu, Hawaii, October
    • Katja Filippova and Michael Strube. 2008. Sentence fusion via dependency graph compression. In Proceedings of the 2008 EMNLP, pages 177-185, Honolulu, Hawaii, October.
    • (2008) Proceedings of the 2008 EMNLP , pp. 177-185
    • Filippova, K.1    Strube, M.2
  • 10
    • 0842331879 scopus 로고    scopus 로고
    • Speech summarization: An approach through word extraction and a method for evaluation
    • C. Hori and Sadaoki Furui. 2004. Speech summarization: an approach through word extraction and a method for evaluation. IEICE Transactions on Information and Systems, E87-D(1):15-25.
    • (2004) IEICE Transactions on Information and Systems , vol.E87-D , Issue.1 , pp. 15-25
    • Hori, C.1    Furui, S.2
  • 11
    • 85146417759 scopus 로고    scopus 로고
    • CAccurate unlexicalized parsing
    • Sapporo, Japan, July
    • Dan Klein and Christopher D. Manning. 2003. Accurate unlexicalized parsing. In Proceedings of the 41st ACL, pages 423-430, Sapporo, Japan, July.
    • (2003) Proceedings of the 41st ACL , pp. 423-430
    • Klein, D.1    Manning, C.D.2
  • 12
    • 0036641584 scopus 로고    scopus 로고
    • Summarization beyond sentence extraction: A probabilistic approach to sentence compression
    • Kevin Knight and Daniel 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
  • 13
    • 0142192295 scopus 로고    scopus 로고
    • Conditional random fields: Probabilistic models for segmenting and labeling sequence data
    • John Lafferty, Andrew MacCallum, and Fernando Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of the 18th ICML-2001.
    • (2001) Proceedings of the 18th ICML-2001
    • Lafferty, J.1    MacCallum, A.2    Pereira, F.3
  • 14
    • 84893398389 scopus 로고    scopus 로고
    • Discriminative sentence compression with soft syntactic evidence
    • Ryan McDonald. 2006. Discriminative sentence compression with soft syntactic evidence. In Proceedings of the 11th EACL, pages 297-304.
    • (2006) Proceedings of the 11th EACL , pp. 297-304
    • McDonald, R.1
  • 15
    • 0038293491 scopus 로고
    • A stochastic japanese morphological analyzer using a forward-dp backward-a* nbest search algorithm
    • Masaaki Nagata. 1994. A stochastic japanese morphological analyzer using a forward-dp backward-a* nbest search algorithm. In Proceedings of COLING-94.
    • (1994) Proceedings of COLING-94
    • Nagata, M.1
  • 16
    • 77953251325 scopus 로고    scopus 로고
    • A generic sentence trimmer with CRFs
    • Columbus, Ohio, June
    • Tadashi Nomoto. 2008. A generic sentence trimmer with CRFs. In Proceedings of ACL-08: HLT, pages 299-307, Columbus, Ohio, June.
    • (2008) Proceedings of ACL-08: HLT , pp. 299-307
    • Nomoto, T.1
  • 17
    • 33646414611 scopus 로고    scopus 로고
    • Statistical sentence condensation using ambiguity packing and stochastic disambiguation methods for lexical functional grammar
    • Edmonton
    • Stefan Riezler, Tracy H. King, Richard Crouch, and Annie Zaenen. 2003. Statistical sentence condensation using ambiguity packing and stochastic disambiguation methods for lexical functional grammar. In Proceedings of HLT-NAACL 2003, pages 118-125, Edmonton.
    • (2003) Proceedings of HLT-NAACL 2003 , pp. 118-125
    • Riezler, S.1    King, T.H.2    Crouch, R.3    Zaenen, A.4
  • 18
    • 0019887799 scopus 로고
    • Identification of common molecular subsequence
    • T. F. Smith and M. S. Waterman. 1981. Identification of common molecular subsequence. Journal of Molecular Biology, 147:195-197.
    • (1981) Journal of Molecular Biology , vol.147 , pp. 195-197
    • Smith, T.F.1    Waterman, M.S.2
  • 20
    • 84859919694 scopus 로고    scopus 로고
    • Supervised and unsupervised learning for sentence compression
    • Ann Arbor, June
    • Jenie Turner and Eugen Charniak. 2005. Supervised and unsupervised learning for sentence compression. In Proceedings of the 43rd ACL, pages 290-297, Ann Arbor, June.
    • (2005) Proceedings of the 43rd ACL , pp. 290-297
    • Turner, J.1    Charniak, E.2
  • 21
    • 33750260790 scopus 로고    scopus 로고
    • Sentence compression using statistical information about dependency path length
    • Proceedings of TSD 2006, Brno, Czech Republic
    • Kiwamu Yamagata, Satoshi Fukutomi, Kazuyuki Takagi, and Kzauhiko Ozeki. 2006. Sentence compression using statistical information about dependency path length. In Proceedings of TSD 2006 (Lecture Notes in Computer Science, Vol. 4188/2006), pages 127-134, Brno, Czech Republic.
    • (2006) Lecture Notes in Computer Science , vol.4188 , Issue.2006 , pp. 127-134
    • Yamagata, K.1    Fukutomi, S.2    Takagi, K.3    Ozeki, K.4


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