메뉴 건너뛰기




Volumn 2, Issue , 2013, Pages 714-718

Learning semantic textual similarity with structural representations

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; SYNTACTICS;

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

References (17)
  • 2
    • 85007314681 scopus 로고    scopus 로고
    • Ukp: Computing semantic textual similarity by combining multiple content similarity measures
    • Daniel Bar, Chris Biemann, Iryna Gurevych, and Torsten Zesch. 2012. Ukp: Computing semantic textual similarity by combining multiple content similarity measures. In SemEval.
    • (2012) SemEval
    • Bar, D.1    Biemann, C.2    Gurevych, I.3    Zesch, T.4
  • 3
    • 80053364056 scopus 로고    scopus 로고
    • Broad-coverage sense disambiguation and information extraction with a supersense sequence tagger
    • Massimiliano Ciaramita and Yasemin Altun. 2006. Broad-coverage sense disambiguation and information extraction with a supersense sequence tagger. In EMNLP.
    • (2006) EMNLP
    • Ciaramita, M.1    Altun, Y.2
  • 4
    • 33646057547 scopus 로고    scopus 로고
    • New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron
    • Michael Collins and Nigel Duffy. 2002. New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron. In ACL.
    • (2002) ACL
    • Collins, M.1    Duffy, N.2
  • 5
    • 67049098006 scopus 로고    scopus 로고
    • Why stacked models perform effective collective classification
    • Andrew S. Fast and David Jensen. 2008. Why stacked models perform effective collective classification. In ICDM.
    • (2008) ICDM
    • Fast, A.S.1    Jensen, D.2
  • 6
    • 84880915872 scopus 로고    scopus 로고
    • Computing semantic relatedness using wikipedia-based explicit semantic analysis
    • Evgeniy Gabrilovich and Shaul Markovitch. 2007. Computing semantic relatedness using wikipedia-based explicit semantic analysis. In IJCAI.
    • (2007) IJCAI
    • Gabrilovich, E.1    Markovitch, S.2
  • 7
    • 80054692769 scopus 로고    scopus 로고
    • Tree edit models for recognizing textual entailments, paraphrases, and answers to questions
    • Michael Heilman and Noah A. Smith. 2010. Tree edit models for recognizing textual entailments, paraphrases, and answers to questions. In NAACL.
    • (2010) NAACL
    • Heilman, M.1    Smith, N.A.2
  • 8
    • 80053417049 scopus 로고    scopus 로고
    • Kernels on linguistic structures for answer extraction
    • Alessandro Moschitti and Silvia Quarteroni. 2008. Kernels on linguistic structures for answer extraction. In ACL.
    • (2008) ACL
    • Moschitti, A.1    Quarteroni, S.2
  • 9
    • 34547970260 scopus 로고    scopus 로고
    • Fast and effective kernels for relational learning from texts
    • Alessandro Moschitti and Fabio Massimo Zanzotto. 2007. Fast and effective kernels for relational learning from texts. In ICML.
    • (2007) ICML
    • Moschitti, A.1    Zanzotto, F.M.2
  • 10
    • 70349231969 scopus 로고    scopus 로고
    • Exploiting syntactic and shallow semantic kernels for question/answer classification
    • Alessandro Moschitti, Silvia Quarteroni, Roberto Basili, and Suresh Manandhar. 2007. Exploiting syntactic and shallow semantic kernels for question/answer classification. In ACL.
    • (2007) ACL
    • Moschitti, A.1    Quarteroni, S.2    Basili, R.3    Manandhar, S.4
  • 11
    • 34547975798 scopus 로고    scopus 로고
    • Efficient convolution kernels for dependency and constituent syntactic trees
    • Alessandro Moschitti. 2006. Efficient convolution kernels for dependency and constituent syntactic trees. In ECML.
    • (2006) ECML
    • Moschitti, A.1
  • 12
    • 70349257998 scopus 로고    scopus 로고
    • Kernel methods, syntax and semantics for relational text categorization
    • Alessandro Moschitti. 2008. Kernel methods, syntax and semantics for relational text categorization. In CIKM.
    • (2008) CIKM
    • Moschitti, A.1
  • 13
    • 84866604545 scopus 로고    scopus 로고
    • Structural relationships for large-scale learning of answer re-ranking
    • Aliaksei Severyn and Alessandro Moschitti. 2012. Structural relationships for large-scale learning of answer re-ranking. In SIGIR.
    • (2012) SIGIR
    • Severyn, A.1    Moschitti, A.2
  • 15
    • 80053434997 scopus 로고    scopus 로고
    • Probabilistic tree-edit models with structured latent variables for textual entailment and question answering
    • Mengqiu Wang and Christopher D. Manning. 2010. Probabilistic tree-edit models with structured latent variables for textual entailment and question answering. In ACL.
    • (2010) ACL
    • Wang, M.1    Manning, C.D.2
  • 16
    • 80053356836 scopus 로고    scopus 로고
    • What is the jeopardy model? A quasi-synchronous grammar for qa
    • Mengqiu Wang, Noah A. Smith, and Teruko Mitaura. 2007. What is the jeopardy model? a quasi-synchronous grammar for qa. In EMNLP.
    • (2007) EMNLP
    • Wang, M.1    Smith, N.A.2    Mitaura, T.3
  • 17
    • 80053411996 scopus 로고    scopus 로고
    • Phrase dependency parsing for opinion mining
    • Yuanbin Wu, Qi Zhang, Xuanjing Huang, and Lide Wu. 2009. Phrase dependency parsing for opinion mining. In EMNLP.
    • (2009) EMNLP
    • Wu, Y.1    Zhang, Q.2    Huang, X.3    Wu, L.4


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