Reference Grounding Algorithm

A Reference Grounding Algorithm is a multiclass classification algorithm that can be implemented into a reference grounding system (to solve a reference resolution task).

• AKA: Disambiguation Algorithm, Grounding Algorithm, Resolution Algorithm, Normalization Algorithm.
• Context:
  • It can range from being a Heuristic Reference Grounding Algorithm to being a Data-Driven Reference Grounding Algorithm (such as a Supervised).
  • It can be supported by a Recognition Algorithm.
• Example(s):
  • an Entity Reference Grounding Algorithm, such as
    • a Named Entity Resolution Algorithm.
    • a Coreference Resolution Algorithm.
    • a Semantic Reference Resolution Algorithm.
  • a Relation Reference Grounding Algorithm, such as ...
  • …
• Counter-Example(s):
  • a Co-Reference Resolution Algorithm.
  • a Named Entity Recognition Algorithm.
• See: Clustering Algorithm.

---