Partial parsing via finite-state cascades
Natural Language Engineering1996Vol. 2(4), pp. 337–344
Citations Over TimeTop 1% of 1996 papers
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.
Related Papers
- Parsing Schemata - a framework for specification and analysis of parsing algorithms(1997)
- → Building parsers based on syntax diagrams with multiport components(2022)1 cited
- → Multiple-Human Parsing in the Wild(2017)61 cited
- → Partial Parsing: Combining Choice with Commitment(2008)6 cited
- → Analyzing Holistic Parsers: Implications for Robust Parsing and Systematicity(2001)2 cited