Relation Mention Classification Algorithm

A Relation Mention Classification Algorithm is a classification algorithm that can solve a relation mention classification task.

• Context:
  • It can range from being a Fully-Supervised Relation Mention Classification Algorithm, Semi-Supervised Relation Mention Classification Algorithm, or a Unsupervised Relation Mention Classification Algorithm.
  • It can support a Semantic Relation Mention Recognition Task.
• Counter-Example(s):
  • a Relation Mention Identification Algorithm
  • a Relation Mention Recognition Algorithm.
  • an Entity Mention Classification Algorithm.
• See: TeGRR Algorithm, Named Entity Recognition Task.

---