Dependency Grammar-based Relation Recognition Classifier

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