The recognition capacity of local syntactic constraints

  • Authors:
  • Mori Rimon;Jacky Herz

  • Affiliations:
  • The Hebrew University of Jerusalem, Giv'at Ram, Jerusalem, Israel;The Hebrew University of Jerusalem, Giv'at Ram, Jerusalem, Israel

  • Venue:
  • EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a grammar for a language, it is possible to create finite state mechanisms that approximate its recognition capacity. These simple automata consider only short context information, drawn from local syntactic constraints which the grammar imposes. While it is short of providing the strong generative capacity of the grammar, such an approximation is useful for removing most word tagging ambiguities, indentifying many cases of ill-formed input, and assisting efficiently in other natural language processing tasks. Our basic approach to the acquisition and usage of local syntactic constraints was presented elsewhere; in this paper we present some formal and empirical results pertaining to properties of the approximating automata.