Hostname: page-component-76c49bb84f-t6sgf Total loading time: 0 Render date: 2025-07-07T01:13:30.173Z Has data issue: false hasContentIssue false
  • English
  • Français

Partial parsing via finite-state cascades

Published online by Cambridge University Press:  01 December 1996

STEVEN ABNEY
STEVEN ABNEY
Affiliation:
SfS, Wilhelmstr. 113, University of Tübingen, 72074 Tübingen, Germany. e-mail: abney@sfs.nphil.uni-tuebingen.de
Get access Rights & Permissions [Opens in a new window]

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.

Information

Type
Research Article
Information
Natural Language Engineering , Volume 2 , Issue 4 , December 1996 , pp. 337 - 344
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable