Relation Mention Recognition Algorithm

From GM-RKB
Jump to: navigation, search

A relation mention recognition algorithm is a recognition algorithm (detection and classification) that can solve a relation mention recognition task.



References

2012

2009

2007

2006

2005

2004

2003

2001

2000

1999

1998

1997

1996

1995


1993

  • (Riloff, 1993) ⇒ Ellen Riloff. (1993). "Automatically Constructing a Dictionary for Information Extraction Tasks." In: Proceedings of the 11th Ann. Conference of Artificial Intelligence (AAAI 1993).

1992

  • (Hearst, 1992) ⇒ Marti Hearst. (1992). "Automatic Acquisition of Hyponyms from Large Text Corpora." In: Proceedings of the 14th International Conference on Computational Linguistics (COLING-1992).(paper.pdf)

1991

  • (Rau, 1991) ⇒ L. Rau. (1991). "Extracting Company Names From Text." In: Proceedings of the Sixth Conference on Artificial Intelligence Applications.

1982

  • De Jong (1982)
    • NOTE: FRUMP system filled in Schank-style “scripts” from newswires; DARPA’s Message Understanding Conference (MUC) [87’-95’], and TIPSTER [92’-96’]

Notes

  • Early start was on news feeds and programed rules (e.g. FSM)
    • E.g. De Jong’s FRUMP [1982] that filled in Schank-style “scripts” from newswires; DARPA’s Message Understanding Conference (MUC) [87’-95’], and TIPSTER [92’-96’]
    • E.g. The finite state machines of SRI’s FASTUS
    • HMM’s in Elkan [Leek 1997]
    • BBN in [Bikel, et al, 1998]