메뉴 건너뛰기




Volumn , Issue , 2013, Pages 65-74

Sentence compression with joint structural inference

Author keywords

[No Author keywords available]

Indexed keywords

SYNTACTICS;

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

References (37)
  • 4
    • 84885484971 scopus 로고    scopus 로고
    • Constraint-based sentence compression: An integer programming approach
    • James Clarke and Mirella Lapata. 2006a. Constraint-based sentence compression: an integer programming approach. In Proceedings of ACL-COLING, pages 144–151.
    • (2006) Proceedings of ACL-COLING , pp. 144-151
    • Clarke, J.1    Lapata, M.2
  • 5
    • 84860530953 scopus 로고    scopus 로고
    • Models for sentence compression: A comparison across domains, training requirements and evaluation measures
    • James Clarke and Mirella Lapata. 2006b. Models for sentence compression: a comparison across domains, training requirements and evaluation measures. In Proceedings of ACL-COLING, pages 377–384.
    • (2006) Proceedings of ACL-COLING , pp. 377-384
    • Clarke, J.1    Lapata, M.2
  • 6
    • 77956317072 scopus 로고    scopus 로고
    • Modelling compression with discourse constraints
    • James Clarke and Mirella Lapata. 2007. Modelling compression with discourse constraints. In Proceedings of EMNLP-CoNLL, pages 1–11.
    • (2007) Proceedings of EMNLP-CoNLL , pp. 1-11
    • Clarke, J.1    Lapata, M.2
  • 7
    • 44449150380 scopus 로고    scopus 로고
    • Global inference for sentence compression: An integer linear programming approach
    • March
    • James Clarke and Mirella Lapata. 2008. Global inference for sentence compression: an integer linear programming approach. Journal for Artificial Intelligence Research, 31:399–429, March.
    • (2008) Journal for Artificial Intelligence Research , vol.31 , pp. 399-429
    • Clarke, J.1    Lapata, M.2
  • 8
    • 77958074280 scopus 로고    scopus 로고
    • Discourse constraints for document compression
    • James Clarke and Mirella Lapata. 2010. Discourse constraints for document compression. Computational Linguistics, 36(3):411–441.
    • (2010) Computational Linguistics , vol.36 , Issue.3 , pp. 411-441
    • Clarke, J.1    Lapata, M.2
  • 9
    • 77956315873 scopus 로고    scopus 로고
    • Sentence compression as tree transduction
    • April
    • Trevor Cohn and Mirella Lapata. 2009. Sentence compression as tree transduction. Journal of Artificial Intelligence Research, 34(1):637–674, April.
    • (2009) Journal of Artificial Intelligence Research , vol.34 , Issue.1 , pp. 637-674
    • Cohn, T.1    Lapata, M.2
  • 10
    • 85127836544 scopus 로고    scopus 로고
    • Discriminative training methods for hidden markov models
    • Michael Collins. 2002. Discriminative training methods for hidden Markov models. In Proceedings of EMNLP, pages 1–8.
    • (2002) Proceedings of EMNLP , pp. 1-8
    • Collins, M.1
  • 11
    • 85149112004 scopus 로고    scopus 로고
    • A noisy-channel model for document compression
    • Hal Daumé, III and Daniel Marcu. 2002. A noisy-channel model for document compression. In Proceedings of ACL, pages 449–456.
    • (2002) Proceedings of ACL , pp. 449-456
    • Daumé, H.1    Marcu, D.2
  • 12
    • 84857523603 scopus 로고    scopus 로고
    • The complexity of phrase alignment problems
    • John DeNero and Dan Klein. 2008. The complexity of phrase alignment problems. In Proceedings of ACL-HLT, pages 25–28.
    • (2008) Proceedings of ACL-HLT , pp. 25-28
    • DeNero, J.1    Klein, D.2
  • 13
    • 77958025267 scopus 로고    scopus 로고
    • Reluctant paraphrase: Textual restructuring under an optimisation model
    • Mark Dras. 1997. Reluctant paraphrase: Textual restructuring under an optimisation model. In Proceedings of PacLing, pages 98–104.
    • (1997) Proceedings of PacLing , pp. 98-104
    • Dras, M.1
  • 14
    • 80053286706 scopus 로고    scopus 로고
    • Dependency tree based sentence compression
    • Katja Filippova and Michael Strube. 2008. Dependency tree based sentence compression. In Proceedings of INLG, pages 25–32.
    • (2008) Proceedings of INLG , pp. 25-32
    • Filippova, K.1    Strube, M.2
  • 15
    • 83455243883 scopus 로고    scopus 로고
    • An extractive supervised two-stage method for sentence compression
    • Dimitrios Galanis and Ion Androutsopoulos. 2010. An extractive supervised two-stage method for sentence compression. In Proceedings of HLT-NAACL, pages 885–893.
    • (2010) Proceedings of HLT-NAACL , pp. 885-893
    • Galanis, D.1    Androutsopoulos, I.2
  • 16
    • 77956328274 scopus 로고    scopus 로고
    • Lexicalized markov grammars for sentence compression
    • April
    • Michel Galley and Kathleen McKeown. 2007. Lexicalized Markov grammars for sentence compression. In Proceedings of HLT-NAACL, pages 180–187, April.
    • (2007) Proceedings of HLT-NAACL , pp. 180-187
    • Galley, M.1    McKeown, K.2
  • 17
    • 80053228491 scopus 로고    scopus 로고
    • Learning sentential paraphrases from bilingual parallel corpora for text-to-text generation
    • Juri Ganitkevitch, Chris Callison-Burch, Courtney Napoles, and Benjamin Van Durme. 2011. Learning sentential paraphrases from bilingual parallel corpora for text-to-text generation. In Proceedings of EMNLP, pages 1168–1179.
    • (2011) Proceedings of EMNLP , pp. 1168-1179
    • Ganitkevitch, J.1    Callison-Burch, C.2    Napoles, C.3    van Durme, B.4
  • 18
    • 0842331879 scopus 로고    scopus 로고
    • Speech summarization: An approach through word extraction and a method for evaluation
    • Chiori 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
  • 19
    • 85084278962 scopus 로고    scopus 로고
    • Cut and paste based text summarization
    • Hongyan Jing and Kathleen R. McKeown. 2000. Cut and paste based text summarization. In Proceedings of NAACL, pages 178–185.
    • (2000) Proceedings of NAACL , pp. 178-185
    • Jing, H.1    McKeown, K.R.2
  • 21
    • 10644277499 scopus 로고    scopus 로고
    • Statistics-based summarization - step one: Sentence compression
    • Kevin Knight and Daniel Marcu. 2000. Statistics-based summarization - step one: Sentence compression. In Proceedings of AAAI, pages 703–710.
    • (2000) Proceedings of AAAI , pp. 703-710
    • Knight, K.1    Marcu, D.2
  • 22
    • 0036641584 scopus 로고    scopus 로고
    • Summarization beyond sentence extraction: A probabilistic approach to sentence compression
    • July
    • Kevin Knight and Daniel Marcu. 2002. Summarization beyond sentence extraction: a probabilistic approach to sentence compression. Artificial Intelligence, 139(1):91–107, July.
    • (2002) Artificial Intelligence , vol.139 , Issue.1 , pp. 91-107
    • Knight, K.1    Marcu, D.2
  • 23
    • 0039003643 scopus 로고
    • Technical Report 290-94, Massechusetts Institute of Technology, Operations Research Center
    • Thomas L. Magnanti and Laurence A. Wolsey. 1994. Optimal trees. In Technical Report 290-94, Massechusetts Institute of Technology, Operations Research Center.
    • (1994) Optimal Trees
    • Magnanti, T.L.1    Wolsey, L.A.2
  • 25
    • 84859887629 scopus 로고    scopus 로고
    • Concise integer linear programming formulations for dependency parsing
    • André F. T. Martins, Noah A. Smith, and Eric P. Xing. 2009. Concise integer linear programming formulations for dependency parsing. In Proceedings of ACL-IJCNLP, pages 342–350.
    • (2009) Proceedings of ACL-IJCNLP , pp. 342-350
    • Martins, A.F.T.1    Smith, N.A.2    Xing, E.P.3
  • 26
    • 84859925125 scopus 로고    scopus 로고
    • Online large-margin training of dependency parsers
    • Ryan McDonald, Koby Crammer, and Fernando Pereira. 2005. Online large-margin training of dependency parsers. In Proceedings of ACL, pages 91–98.
    • (2005) Proceedings of ACL , pp. 91-98
    • McDonald, R.1    Crammer, K.2    Pereira, F.3
  • 27
    • 84893398389 scopus 로고    scopus 로고
    • Discriminative sentence compression with soft syntactic evidence
    • Ryan McDonald. 2006. Discriminative sentence compression with soft syntactic evidence. In Proceedings of EACL, pages 297–304.
    • (2006) Proceedings of EACL , pp. 297-304
    • McDonald, R.1
  • 30
    • 34547945995 scopus 로고    scopus 로고
    • Discriminative sentence compression with conditional random fields
    • November
    • Tadashi Nomoto. 2007. Discriminative sentence compression with conditional random fields. Information Processing and Management, 43(6):1571–1587, November.
    • (2007) Information Processing and Management , vol.43 , Issue.6 , pp. 1571-1587
    • Nomoto, T.1
  • 31
    • 80053349723 scopus 로고    scopus 로고
    • Incremental integer linear programming for non-projective dependency parsing
    • Sebastian Riedel and James Clarke. 2006. Incremental integer linear programming for non-projective dependency parsing. In Proceedings of EMNLP, pages 129–137.
    • (2006) Proceedings of EMNLP , pp. 129-137
    • Riedel, S.1    Clarke, J.2
  • 32
    • 33646414611 scopus 로고    scopus 로고
    • Statistical sentence condensation using ambiguity packing and stochastic disambiguation methods for lexical-functional grammar
    • 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, pages 118–125.
    • (2003) Proceedings of HLT-NAACL , pp. 118-125
    • Riezler, S.1    King, T.H.2    Crouch, R.3    Zaenen, A.4
  • 33
    • 80053231397 scopus 로고    scopus 로고
    • Exact decoding of syntactic translation models through lagrangian relaxation
    • Alexander M. Rush and Michael Collins. 2011. Exact decoding of syntactic translation models through lagrangian relaxation. In Proceedings of ACL-HLT, pages 72–82.
    • (2011) Proceedings of ACL-HLT , pp. 72-82
    • Rush, A.M.1    Collins, M.2
  • 34
    • 84926350611 scopus 로고    scopus 로고
    • A joint phrasal and dependency model for paraphrase alignment
    • Kapil Thadani, Scott Martin, and Michael White. 2012. A joint phrasal and dependency model for paraphrase alignment. In Proceedings of COLING, pages 1229–1238.
    • (2012) Proceedings of COLING , pp. 1229-1238
    • Thadani, K.1    Martin, S.2    White, M.3
  • 35
    • 84859919694 scopus 로고    scopus 로고
    • Supervised and unsupervised learning for sentence compression
    • Jenine Turner and Eugene Charniak. 2005. Supervised and unsupervised learning for sentence compression. In Proceedings of ACL, pages 290–297.
    • (2005) Proceedings of ACL , pp. 290-297
    • Turner, J.1    Charniak, E.2
  • 36
    • 41849143496 scopus 로고    scopus 로고
    • Trimming CFG parse trees for sentence compression using machine learning approaches
    • Yuya Unno, Takashi Ninomiya, Yusuke Miyao, and Jun’ichi Tsujii. 2006. Trimming CFG parse trees for sentence compression using machine learning approaches. In Proceedings of ACL-COLING, pages 850–857.
    • (2006) Proceedings of ACL-COLING , pp. 850-857
    • Unno, Y.1    Ninomiya, T.2    Miyao, Y.3    Tsujii, J.4
  • 37
    • 84876804329 scopus 로고    scopus 로고
    • Multiple aspect summarization using integer linear programming
    • Kristian Woodsend and Mirella Lapata. 2012. Multiple aspect summarization using integer linear programming. In Proceedings of EMNLP, pages 233–243.
    • (2012) Proceedings of EMNLP , pp. 233-243
    • Woodsend, K.1    Lapata, M.2


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