Systematic construction of a versatile case system

  • Authors:

  • Ken Barker;Terry Copeck;Stan Szpakowicz;Sylvain Delisle

  • Affiliations:

  • School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada, K1N 6N5/ e-mail: {kbarker, terry, szpak}@csi.uottawa.ca;School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada, K1N 6N5/ e-mail: {kbarker, terry, szpak}@csi.uottawa.ca;School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada, K1N 6N5/ e-mail: {kbarker, terry, szpak}@csi.uottawa.ca;Dé/partement de mathé/matiques et d'informatique, Université/ du Qué/bec à/ Trois-Riviè/res, Trois-Riviè/res, Qué/bec, Canada, G9A 5H7/ e-mail: Sylvain_Delisle@uqtr ...

  • Venue:
  • Natural Language Engineering
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Case systems abound in natural language processing. Almost any attempt to recognize and uniformly represent relationships within a clause – a unit at the centre of any linguistic system that goes beyond word level statistics – must be based on semantic roles drawn from a small, closed set. The set of roles describing relationships between a verb and its arguments within a clause is a case system. What is required of such a case system? How does a natural language practitioner build a system that is complete and detailed yet practical and natural? This paper chronicles the construction of a case system from its origin in English marker words to its successful application in the analysis of English text.