Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Partial Parsing via Finite-State Cascades Steven Abney
 

Summary: Partial Parsing via Finite-State Cascades
Steven Abney
1996
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 con-
struct 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 corpus-oriented computational linguistics are techniques
for bootstrapping broad-coverage parsers from text corpora. The work described
here is a step along the way toward a bootstrapping scheme that involves induc-
ing a tagger from word distributions, a lowlevel "chunk" parser from a tagged
corpus, and lexical dependencies from a chunked corpus. In particular, I de-
scribe a chunk parsing technique based on what I will call a finite-state cas-
cade. Though I shall not address the question of inducing such a parser from
a corpus, the parsing technique has been implemented and is being used in a

  

Source: Abney, Steven P. - School of Information, University of Michigan

 

Collections: Computer Technologies and Information Sciences