메뉴 건너뛰기




Volumn 1, Issue , 2015, Pages 1003-1013

Structural representations for learning relations between pairs of texts

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; SEMANTICS; SUPPORT VECTOR MACHINES; SYNTACTICS; TREES (MATHEMATICS);

EID: 84943805083     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/v1/p15-1097     Document Type: Conference Paper
Times cited : (46)

References (40)
  • 1
    • 85007314681 scopus 로고    scopus 로고
    • Ukp: Computing semantic textual similarity by combining multiple content similarity measures
    • ACL
    • Daniel Bär, Chris Biemann, Iryna Gurevych, and Torsten Zesch. 2012. Ukp: Computing semantic textual similarity by combining multiple content similarity measures. In Proc. of SemEval 12. ACL.
    • (2012) Proc. of SemEval , vol.12
    • Bär, D.1    Biemann, C.2    Gurevych, I.3    Zesch, T.4
  • 3
    • 84862288194 scopus 로고    scopus 로고
    • Introduction to the conll-2005 shared task: Semantic role labeling
    • Xavier Carreras and Llúis Marquez. 2005. Introduction to the conll-2005 shared task: Semantic role labeling. In Proc. of CONLL 05, USA.
    • (2005) Proc. of CONLL 05, USA
    • Carreras, X.1    Marquez, L.2
  • 8
    • 80053238554 scopus 로고    scopus 로고
    • Structured lexical similarity via convolution kernels on dependency trees
    • Danilo Croce, Alessandro Moschitti, and Roberto Basili. 2011. Structured lexical similarity via convolution kernels on dependency trees. In Proceedings EMNLP.
    • (2011) Proceedings EMNLP
    • Croce, D.1    Moschitti, A.2    Basili, R.3
  • 10
    • 85105937549 scopus 로고    scopus 로고
    • Unsupervised construction of large paraphrase corpora: Exploiting massively parallel news sources
    • Bill Dolan, Chris Quirk, and Chris Brockett. 2004. Unsupervised construction of large paraphrase corpora: Exploiting massively parallel news sources. In Proc. of COLING 04, Stroudsburg, PA, USA.
    • (2004) Proc. of COLING 04, Stroudsburg, PA, USA
    • Dolan, B.1    Quirk, C.2    Brockett, C.3
  • 12
    • 84880915872 scopus 로고    scopus 로고
    • Computing semantic relatedness using wikipediabased explicit semantic analysis
    • Evgeniy Gabrilovich and Shaul Markovitch. 2007. Computing semantic relatedness using wikipediabased explicit semantic analysis. In Proc. of IJCAI-07, pages 1606-1611.
    • (2007) Proc. of IJCAI-07 , pp. 1606-1611
    • Gabrilovich, E.1    Markovitch, S.2
  • 13
    • 9444266406 scopus 로고    scopus 로고
    • On graph kernels : Hardness results and efficient alternatives
    • Thomas Gartner, P Flach, and S Wrobel. 2003. On Graph Kernels : Hardness Results and Efficient Alternatives. LNCS, pages 129-143.
    • (2003) LNCS , pp. 129-143
    • Gartner, T.1    Flach, P.2    Wrobel, S.3
  • 15
    • 0040076126 scopus 로고    scopus 로고
    • Automatic labeling of semantic roles
    • Daniel Gildea and Daniel Jurafsky. 2002. Automatic labeling of semantic roles. Computational Linguistics, 28:245-288.
    • (2002) Computational Linguistics , vol.28 , pp. 245-288
    • Gildea, D.1    Jurafsky, D.2
  • 16
    • 84937872376 scopus 로고    scopus 로고
    • Translating questions to sql queries with generative parsers discriminatively reranked
    • Alessandra Giordani and Alessandro Moschitti. 2012. Translating questions to sql queries with generative parsers discriminatively reranked. In COLING (Posters), pages 401-410.
    • (2012) COLING (Posters , pp. 401-410
    • Giordani, A.1    Moschitti, A.2
  • 20
    • 1942516986 scopus 로고    scopus 로고
    • Marginalized kernels between labeled graphs
    • AAAI Press
    • Hisashi Kashima, Koji Tsuda, and Akihiro Inokuchi. 2003. Marginalized kernels between labeled graphs. In ICML, pages 321-328. AAAI Press.
    • (2003) ICML , pp. 321-328
    • Kashima, H.1    Tsuda, K.2    Inokuchi, A.3
  • 22
    • 60949112299 scopus 로고    scopus 로고
    • Graph kernels based on tree patterns for molecules
    • October
    • Pierre Mahé and Jean-Philippe Vert. 2008. Graph kernels based on tree patterns for molecules. Machine Learning, 75(1):3-35, October.
    • (2008) Machine Learning , vol.75 , Issue.1 , pp. 3-35
    • Mahé, P.1    Vert, J.2
  • 24
    • 85184862820 scopus 로고    scopus 로고
    • Distant supervision for relation extraction without labeled data
    • Mike Mintz, Steven Bills, Rion Snow, and Daniel Jurafsky. 2009. Distant supervision for relation extraction without labeled data. In ACL-AFNLP.
    • (2009) ACL-AFNLP
    • Mintz, M.1    Bills, S.2    Snow, R.3    Jurafsky, D.4
  • 25
    • 33750333944 scopus 로고    scopus 로고
    • Efficient convolution kernels for dependency and constituent syntactic trees
    • Alessandro Moschitti. 2006. Efficient convolution kernels for dependency and constituent syntactic trees. In Proc. of ECML06, pages 318-329.
    • (2006) Proc. of ECML06 , pp. 318-329
    • Moschitti, A.1
  • 28
    • 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
  • 29
    • 84906925685 scopus 로고    scopus 로고
    • Automatic feature engineering for answer selection and extraction
    • Aliaksei Severyn and Alessandro Moschitti. 2013. Automatic feature engineering for answer selection and extraction. In EMNLP, pages 458-467.
    • (2013) EMNLP , pp. 458-467
    • Severyn, A.1    Moschitti, A.2
  • 34
    • 85162476102 scopus 로고    scopus 로고
    • Dynamic pooling and unfolding recursive autoencoders for paraphrase detection
    • Richard Socher, Eric H. Huang, Jeffrey Pennin, Christopher D Manning, and Andrew Y. Ng. 2011. Dynamic pooling and unfolding recursive autoencoders for paraphrase detection. In NIPS 24.
    • (2011) NIPS , vol.24
    • Socher, R.1    Huang, E.H.2    Pennin, J.3    Manning, C.D.4    Ng, A.Y.5
  • 35
    • 84905684773 scopus 로고    scopus 로고
    • Supervised all-words lexical substitution using delexicalized features
    • György Szarvas, Chris Biemann, and Iryna Gurevych. 2013. Supervised all-words lexical substitution using delexicalized features. In NAACL.
    • (2013) NAACL
    • Szarvas, G.1    Biemann, C.2    Gurevych, I.3
  • 36
    • 84905674833 scopus 로고    scopus 로고
    • Encoding semantic resources in syntactic structures for passage reranking
    • Kateryna Tymoshenko, Alessandro Moschitti, and Aliaksei Severyn. 2014. Encoding semantic resources in syntactic structures for passage reranking. EACL 2014, page 664.
    • (2014) EACL 2014 , pp. 664
    • Tymoshenko, K.1    Moschitti, A.2    Severyn, A.3
  • 40
    • 76449118321 scopus 로고    scopus 로고
    • A machine learning approach to textual entailment recognition
    • October
    • Fabio massimo Zanzotto, Marco Pennacchiotti, and Alessandro Moschitti 2009 A machine learning approach to textual entailment recognition. Nat. Lang. Eng 15 4 551-582, October.
    • (2009) Nat. Lang. Eng , vol.15 , Issue.4 , pp. 551-582
    • Massimo Zanzotto, F.1    Pennacchiotti, M.2    Moschitti, A.3


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