1 / 7

Dependencies encode relational structure

This study explores the application of Stanford Dependencies in relation extraction, demonstrating how dependency paths identify complex relations such as protein interactions. Key examples illustrate how nsubj, ccomp, and conj are utilized to characterize relationships in syntactic structures, enhancing semantic understanding in natural language processing. The research highlights the effectiveness of projective dependency representations generated through various parsing techniques, paving the way for more refined semantic analysis in BioNLP tasks.

mahdis
Download Presentation

Dependencies encode relational structure

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Dependencies encode relational structure Relation Extraction with Stanford Dependencies

  2. demonstrated nsubj ccomp results interacts prep_with compl det SasA advmod that nsubj conj_and conj_and The KaiC rythmically KaiB KaiA Dependency paths identify relations like protein interaction [Erkan et al. EMNLP 07, Fundel et al. 2007] KaiCnsubj interacts prep_withSasA KaiCnsubj interacts prep_withSasAconj_andKaiA KaiCnsubj interacts prep_withSasAconj_andKaiB

  3. Stanford Dependencies [de Marneffe et al. LREC 2006] • The basic dependency representation is projective • It can be generated by postprocessing headed phrase structure parses (Penn Treebank syntax) • It can also be generated directly by dependency parsers, such as MaltParser, or the Easy-First Parser jumped prep nsubj over boy pobj amod det the little the det fence

  4. amod conj partmod computer based prep in Graph modification to facilitate semantic analysis Bell, based in LA, makes and distributes electronic and computer products. conj distributes makes nsubj dobj cc products cc and Bell and electronic pobj LA

  5. amod conj_and partmod computer based prep_in Graph modification to facilitate semantic analysis Bell, based in LA, makes and distributes electronic and computer products. nsubj conj_and distributes makes nsubj dobj products amod Bell electronic LA

  6. BioNLP 2009/2011 relation extraction shared tasks [Björne et al. 2009]

  7. Dependencies encode relational structure Relation Extraction with Stanford Dependencies

More Related