Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Natural Language Engineering 1 (1): 000000 c 1995 Cambridge University Press 1 Partial Parsing via Finite-State Cascades
 

Summary: Natural Language Engineering 1 (1): 000­000 c 1995 Cambridge University Press 1
Partial Parsing via Finite-State Cascades
STEVEN ABNEY
SfS, Wilhelmstr. 113
University of Tšubingen
72074 Tšubingen, Germany
abney@sfs.nphil.uni-tuebingen.de
(Received 3 March2002)
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.
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 inducing a
tagger from word distributions, a lowlevel "chunk" parser from a tagged corpus,
and lexical dependencies from a chunked corpus. In particular, I describe a chunk

  

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

 

Collections: Computer Technologies and Information Sciences