Partial parsing via finite-state cascades

  title={Partial parsing via finite-state cascades},
  author={Steven P. Abney},
  journal={Natural Language Engineering},
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. 1 Finite State Cascades Of current interest in… CONTINUE READING
Highly Influential
This paper has highly influenced 46 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 737 citations. REVIEW CITATIONS
372 Citations
17 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 372 extracted citations

738 Citations

Citations per Year
Semantic Scholar estimates that this publication has 738 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 17 references

Analyse Syntaxique Transformationnelle du Francais par Transducteurs et Lexique-Grammaire

  • Roche, Emmanuel.
  • PhD thesis, Université Paris 7.
  • 1993

Appelt et al . SRI international FASTUS system MUC4 test results and analysis

  • E. Douglas
  • 1992

Monarch . Automatic indexing using selective nlp and first - order thesauri

  • K. Ginther-Webster, M. Hart, R. Lefferts, I.
  • In Proc . of RIAO
  • 1991

Similar Papers

Loading similar papers…