메뉴 건너뛰기




Volumn , Issue , 2008, Pages 907-916

Learning graph walk based similarity measures for parsed text

Author keywords

[No Author keywords available]

Indexed keywords

LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS; TEXT PROCESSING;

EID: 77956217201     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1613715.1613832     Document Type: Conference Paper
Times cited : (29)

References (21)
  • 2
    • 80053262847 scopus 로고    scopus 로고
    • A shortest path dependency kernel for relation extraction
    • Razvan C. Bunescu and Raymond J. Mooney. 2005. A shortest path dependency kernel for relation extraction. In HLT-EMNLP.
    • (2005) HLT-EMNLP
    • Bunescu, R.C.1    Mooney, R.J.2
  • 3
    • 33750362799 scopus 로고    scopus 로고
    • A graphsearch framework for associating gene identifiers with documents
    • William W. Cohen and Einat Minkov. 2006. A graphsearch framework for associating gene identifiers with documents. BMC Bioinformatics, 7(440).
    • (2006) BMC Bioinformatics , vol.7 , Issue.440
    • Cohen, W.W.1    Minkov, E.2
  • 4
    • 33646407289 scopus 로고    scopus 로고
    • Discriminative reranking for natural language parsing
    • Michael Collins and Terry Koo. 2005. Discriminative reranking for natural language parsing. Computational Linguistics, 31(1):25-69.
    • (2005) Computational Linguistics , vol.31 , Issue.1 , pp. 25-69
    • Collins, M.1    Koo, T.2
  • 5
    • 33745769863 scopus 로고    scopus 로고
    • Query expansion using random walk models
    • Kevyn Collins-Thompson and Jamie Callan. 2005. Query expansion using random walk models. In CIKM.
    • (2005) CIKM
    • Collins-Thompson, K.1    Callan, J.2
  • 6
    • 85045072379 scopus 로고    scopus 로고
    • Ranking algorithms for namedentity extraction: Boosting and the voted perceptron
    • Michael Collins. 2002. Ranking algorithms for namedentity extraction: Boosting and the voted perceptron. In ACL.
    • (2002) ACL
    • Collins, M.1
  • 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) LREC
    • De Marneffe, M.-C.1    MacCartney, B.2    Manning, C.D.3
  • 8
    • 84880707332 scopus 로고    scopus 로고
    • Learning web page scores by error backpropagation
    • Michelangelo Diligenti, Marco Gori, and Marco Maggini. 2005. Learning web page scores by error backpropagation. In IJCAI.
    • (2005) IJCAI
    • Diligenti, M.1    Gori, M.2    Maggini, M.3
  • 10
    • 0012990385 scopus 로고
    • Automatic acquisition of hyponyms from large text corpora
    • Marti Hearst. 1992. Automatic acquisition of hyponyms from large text corpora. In COLING.
    • (1992) COLING
    • Hearst, M.1
  • 11
    • 80053374765 scopus 로고    scopus 로고
    • Lexical semantic relatedness with random graph walks
    • Thad Hughes and Daniel Ramage. 2007. Lexical semantic relatedness with random graph walks. In EMNLP.
    • (2007) EMNLP
    • Hughes, T.1    Ramage, D.2
  • 12
    • 84872711078 scopus 로고
    • Noun phrase accessibility and universal grammar
    • Edward Keenan and Bernard Comrie. 1977. Noun phrase accessibility and universal grammar. Linguistic Inquiry, 8.
    • (1977) Linguistic Inquiry , vol.8
    • Keenan, E.1    Comrie, B.2
  • 13
    • 0002557709 scopus 로고    scopus 로고
    • Automatic retrieval and clustering of similar words
    • Dekang Lin. 1998. Automatic retrieval and clustering of similar words. In COLING-ACL.
    • (1998) COLING-ACL
    • Lin, D.1
  • 14
    • 43349158907 scopus 로고    scopus 로고
    • Learning to rank typed graph walks: Local and global approaches
    • Einat Minkov and William W. Cohen. 2007. Learning to rank typed graph walks: Local and global approaches. In WebKDD/KDD-SNA workshop.
    • (2007) WebKDD/KDD-SNA Workshop
    • Minkov, E.1    Cohen, W.W.2
  • 15
    • 33750347523 scopus 로고    scopus 로고
    • Contextual search and name disambiguation in email using graphs
    • Einat Minkov, William W. Cohen, and Andrew Y. Ng. 2006. Contextual search and name disambiguation in email using graphs. In SIGIR.
    • (2006) SIGIR
    • Minkov, E.1    Cohen, W.W.2    Ng, A.Y.3
  • 17
    • 34347357484 scopus 로고    scopus 로고
    • Dependencybased construction of semantic space models
    • Sebastian Padó and Mirella Lapata. 2007. Dependencybased construction of semantic space models. Computational Linguistics, 33(2).
    • (2007) Computational Linguistics , vol.33 , Issue.2
    • Padó, S.1    Lapata, M.2
  • 18
    • 0042357498 scopus 로고    scopus 로고
    • Measuring verb similarity
    • Philip Resnik and Mona Diab. 2000. Measuring verb similarity. In CogSci.
    • (2000) CogSci
    • Resnik, P.1    Diab, M.2
  • 19
    • 84899013308 scopus 로고    scopus 로고
    • Learning syntactic patterns for automatic hypernym discovery
    • Rion Snow, Daniel Jurafsky, and Andrew Y. Ng. 2005. Learning syntactic patterns for automatic hypernym discovery. In NIPS.
    • (2005) NIPS
    • Snow, R.1    Jurafsky, D.2    Ng, A.Y.3
  • 20
    • 85118711993 scopus 로고    scopus 로고
    • Frequency estimates for statistical word similarity measures
    • Egidio Terra and C. L. A. Clarke. 2003. Frequency estimates for statistical word similarity measures. In NAACL.
    • (2003) NAACL
    • Terra, E.1    Clarke, C.L.A.2
  • 21
    • 14344264241 scopus 로고    scopus 로고
    • Learning random walk models for inducing word dependency distributions
    • Kristina Toutanova, Christopher D. Manning, and Andrew Y. Ng. 2004. Learning random walk models for inducing word dependency distributions. In ICML.
    • (2004) ICML
    • Toutanova, K.1    Manning, C.D.2    Ng, A.Y.3


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