• Home
  • Transition-based parsing

Transition-based parsing

Sourcetitle: 
SLTC 2008: Proceedings of the Swedish Language Technology Conference
Year of publication: 
2008
PublicationType: 
Conference paper - peer reviewed

In this paper we introduce a general framework for transition-based parsing algorithms. Among the algorithms that can be described in this framework are deterministic and generalized LR-parsing (Tomita, 1986), incremental tabular parsing such as the Earley algorithm (Earley, 1970), and projective and non-projective depenency parsing (Nivre, 2008).

http://gup.ub.gu.se/records/fulltext/99881.pdf

To the top

Page updated: 2012-01-30 14:03

Send as email
Print page
Show as pdf

X
Loading