메뉴 건너뛰기




Volumn 34, Issue , 2009, Pages 637-674

Sentence compression as tree transduction

Author keywords

[No Author keywords available]

Indexed keywords

BACTERIOPHAGES;

EID: 77956315873     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.2655     Document Type: Article
Times cited : (127)

References (40)
  • 2
    • 0039330854 scopus 로고    scopus 로고
    • Learning dependency translation models as collections of finite state head transducers
    • Alshawi, H., Bangalore, S., & Douglas, S. (2000). Learning dependency translation models as collections of finite state head transducers. Computational Linguistics, 26(1), 45–60.
    • (2000) Computational Linguistics , vol.26 , Issue.1 , pp. 45-60
    • Alshawi, H.1    Bangalore, S.2    Douglas, S.3
  • 3
    • 0002652285 scopus 로고    scopus 로고
    • A maximum entropy approach to natural language processing
    • Berger, A. L., Pietra, S. A. D., & Pietra, V. J. D. (1996). A maximum entropy approach to natural language processing. Computational Linguistics, 22(1), 39–71.
    • (1996) Computational Linguistics , vol.22 , Issue.1 , pp. 39-71
    • Berger, A.L.1    Pietra, S.A.D.2    Pietra, V.J.D.3
  • 8
    • 34347360650 scopus 로고    scopus 로고
    • Hierarchical phrase-based translation
    • Chiang, D. (2007). Hierarchical phrase-based translation. Computational Linguistics, 33(2), 201–228.
    • (2007) Computational Linguistics , vol.33 , Issue.2 , pp. 201-228
    • Chiang, D.1
  • 10
    • 44449150380 scopus 로고    scopus 로고
    • Global inference for sentence compression: An integer linear programming approach
    • Clarke, J., & Lapata, M. (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
  • 12
    • 85127836544 scopus 로고    scopus 로고
    • Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms
    • Morristown, NJ
    • Collins, M. (2002). Discriminative training methods for hidden Markov models: theory and experiments with perceptron algorithms. In Proceedings of the 2002 Conference on Empirical Methods in Natural Language Processing, pp. 1–8, Morristown, NJ.
    • (2002) Proceedings of the 2002 Conference on Empirical Methods in Natural Language Processing , pp. 1-8
    • Collins, M.1
  • 14
    • 0141496132 scopus 로고    scopus 로고
    • Ultraconservative online algorithms for multiclass problems
    • Crammer, K., & Singer, Y. (2003). Ultraconservative online algorithms for multiclass problems. Machine Learning, 3, 951–999.
    • (2003) Machine Learning , vol.3 , pp. 951-999
    • Crammer, K.1    Singer, Y.2
  • 20
    • 33645963554 scopus 로고    scopus 로고
    • Natural language based reformulation resource and wide exploitation for question answering
    • Gaithersburg, MD
    • Hermjakob, U., Echihabi, A., & Marcu, D. (2002). Natural language based reformulation resource and wide exploitation for question answering. In Proceedings of 11th Text Retrieval Conference, Gaithersburg, MD.
    • (2002) Proceedings of 11th Text Retrieval Conference
    • Hermjakob, U.1    Echihabi, A.2    Marcu, D.3
  • 21
    • 0842331879 scopus 로고    scopus 로고
    • Speech summarization: An approach through word extraction and a method for evaluation
    • Hori, C., & Furui, S. (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
  • 25
    • 80053270718 scopus 로고    scopus 로고
    • Decoding complexity in word-replacement translation models
    • Knight, K. (1999). Decoding complexity in word-replacement translation models. Computational Linguistics, 25(4), 607–615.
    • (1999) Computational Linguistics , vol.25 , Issue.4 , pp. 607-615
    • Knight, K.1
  • 26
    • 0036641584 scopus 로고    scopus 로고
    • Summarization beyond sentence extraction: A probabilistic approach to sentence compression
    • Knight, K., & Marcu, D. (2002). Summarization beyond sentence extraction: a probabilistic approach to sentence compression. Artificial Intelligence, 139(1), 91–107.
    • (2002) Artificial Intelligence , vol.139 , Issue.1 , pp. 91-107
    • Knight, K.1    Marcu, D.2
  • 27
    • 84992162860 scopus 로고    scopus 로고
    • Discovery of inference rules for question answering
    • Lin, D., & Pantel, P. (2001). Discovery of inference rules for question answering. Natural Language Engineering, 7(4), 342–360.
    • (2001) Natural Language Engineering , vol.7 , Issue.4 , pp. 342-360
    • Lin, D.1    Pantel, P.2
  • 30
    • 22944469345 scopus 로고    scopus 로고
    • The alignment template approach to statistical machine translation
    • Och, F. J., & Ney, H. (2004). The alignment template approach to statistical machine translation. Computational Linguistics, 30(4), 417–449.
    • (2004) Computational Linguistics , vol.30 , Issue.4 , pp. 417-449
    • Och, F.J.1    Ney, H.2
  • 39
    • 0000319590 scopus 로고    scopus 로고
    • Stochastic inversion transduction grammars and bilingual parsing of parallel corpora
    • Wu, D. (1997). Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics, 23(3), 377–404.
    • (1997) Computational Linguistics , vol.23 , Issue.3 , pp. 377-404
    • Wu, D.1


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