Dependency Grammar-based Relation Recognition Classifier
(Redirected from Dependency Relation Recognition Classifier)
A Dependency Grammar-based Relation Recognition Classifier is a Relation Recognition Classifier that uses patterns based on a Dependency Grammar Parsing of the Sentence.
- AKA: Dependency Relation Recognition Classifier, Dependency Grammar Pattern.
- Context:
- Is a Sentence-based Analysis Classifier.
- It can be a directed or undirected Plannar Graph Data Structure.
- It can have Labeled or Unlabeled edges. E.g. X ⇒ (prep_to) ⇒ Y vs. X ⇒ Y.
- It can be learned by a Dependency Grammar-based Relation Recognition Algorithm.
- Example(s):
- The labeled classifier [PROTEIN p] <= acts ⇒ to ⇒ PDIM ⇒ across ⇒ [LOCATION Daniel S. Weld can work on the sentence: "This suggests that [PROTEIN MmpL7] acts in complex with the synthesis machinery to efficiently transport PDIM across the [LOCATION cell membrane]."
- The unlabeled classifier: [PROTEIN p] <= acts ⇒ to ⇒ PDIM ⇒ across ⇒ [LOCATION Daniel S. Weld can work on the sentence: sentence: "This suggests that [PROTEIN MmpL7] acts in complex with the synthesis machinery to efficiently transport PDIM across the [LOCATION cell membrane]."
- Dependency Grammar-based Relation Recognition Classifier Example.
- …
- Counter-Example(s):
- See: Relational Pattern, Relational Pattern Recognition System, Pattern Recognition System, Dependency Grammar-based Relation Recognition Algorithm, Dependency Grammar-based Relation Recognition Classifier Example, Dependency Grammar.
References
2007
- (Bunescu and Mooney, 2007) ⇒ Razvan C. Bunescu and Raymond Mooney. (2007). paper.pdf "Extracting Relations from Text: From Word Sequences to Dependency Paths". In, Text Mining and Natural Language Processing, Anne Kao and Steve Poteet (eds.), pp. 29-44, Springer.
2005
- (Bunescu and Mooney, 2005) ⇒ Razvan C. Bunescu and Raymond Mooney. (2005). "A Shortest Path Dependency Kernel for Relation Extraction". In: Proceedings of HLT/EMNLP-2005.