Complex Relation Mention Recognition Algorithm

From GM-RKB

Revision as of 13:40, 8 January 2013 by Gmelli (talk | contribs) (Text replace - " (2005)" to " (2005)")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

A Complex Relation Mention Recognition Algorithm is a Relation Mention Recognition Algorithm that can solve a Relation Mention Recognition Task that involves Complex Relation Mention (mentions of a Complex Semantic Relation).

AKA: Complex Semantic Relation Mention Recognition Algorithm.
Context:
- It can be decomposed into a Complex Relation Mention Detection Algorithm, and a Complex Relation Mention Classification Algorithm.
Example(s):
- TeGRR Algorithm
See: Simple Relation Mention Recognition Algorithm.

References

2007

(Melli & al, 2007) ⇒ Gabor Melli, Martin Ester, and Anoop Sarkar. (2007). "Recognition of Multi-sentence n-ary Subcellular Localization Mentions in Biomedical Abstracts." In: Proceedings of the 2nd International Symposium on Languages in Biology and Medicine (LBM 2007).
- Tests on the Subcellular Localization Relation.

2005

(McDonald & al, 2005b) ⇒ Ryan T. McDonald, Fernando Pereira, Seth Kulick, Scott Winters, Yang Jin, and Pete White. (2005). "Simple Algorithms for Complex Relation Extraction with Applications to Biomedical IE." In: Proceedings of the ACL Conference ([[ACL 2005]).
- Tests on the Gene Variation Relation.

Retrieved from "http://www.gabormelli.com/RKB/index.php?title=Complex_Relation_Mention_Recognition_Algorithm&oldid=9620"