Partial parsing via finite-state cascades

  • Authors:
  • Steven Abney

  • Affiliations:
  • SfS, Wilhelmstr. 113, University of Tübingen, 72074 Tübingen, Germany. e-mail: abney@sfs.nphil.uni-tuebingen.de

  • Venue:
  • Natural Language Engineering
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

Finite state cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finite state cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers do not necessarily involve trading off accuracy against speed — they may in fact be more accurate than exhaustive search stochastic context free parsers.