Formal mechanisms for capturing regularizations

Adam Meyers, Ralph Grishman, Michiko Kosaka

Research output: Contribution to conferencePaper

Abstract

While initial treebanks and treebank parsers primarily involved surface analysis, recent work focuses on predicate argument (PA) structure. PA structure provides means to regularize variants (e.g., actives/passives) of sentences so that individual patterns may have better coverage (in MT, QA, IE, etc.), offsetting the sparse data problem. We encode such PA information in the GLARF framework. Our previous work discusses procedures for producing GLARF from treebanks and parsed data. This paper shows that GLARF is particularly well-suited for capturing regularization. We discuss crucial components of GLARF and demonstrate that other frameworks would require equivalent components to adequately express regularization.

Original languageEnglish (US)
Pages723-730
Number of pages8
StatePublished - 2002
Event3rd International Conference on Language Resources and Evaluation, LREC 2002 - Las Palmas, Canary Islands, Spain
Duration: May 29 2002May 31 2002

Other

Other3rd International Conference on Language Resources and Evaluation, LREC 2002
CountrySpain
CityLas Palmas, Canary Islands
Period5/29/025/31/02

ASJC Scopus subject areas

  • Linguistics and Language
  • Language and Linguistics
  • Education
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Formal mechanisms for capturing regularizations'. Together they form a unique fingerprint.

  • Cite this

    Meyers, A., Grishman, R., & Kosaka, M. (2002). Formal mechanisms for capturing regularizations. 723-730. Paper presented at 3rd International Conference on Language Resources and Evaluation, LREC 2002, Las Palmas, Canary Islands, Spain.