Difference between revisions of "Eisner algorithm"
From Cohen Courses
Jump to navigationJump to search| Line 1: | Line 1: | ||
| − | This [[Category::method]] is a widely-used dynamic-programming algorithm, and the basis for many papers, that addresses the problem of [[AddressesProblem::Dependency Parsing]]. It was introduced in [[RelatedPaper::Eisner COLING 1996]] [http://www.cs.jhu.edu/~jason/papers/eisner.coling96.pdf Three New Probabilistic Models for Dependency Parsing: An Exploration] and also described in [http://www.cs.jhu.edu/~jason/papers/eisner.iwptbook00.pdf Eisner 2000 Bilexical Grammars and Their Cubic-Time Parsing Algorithms]. | + | This [[Category::method]] is a widely-used dynamic-programming algorithm, and the basis for many papers, that addresses the problem of [[AddressesProblem::Dependency Parsing]]. It was introduced by Jason Eisner in [[RelatedPaper::Eisner COLING 1996]] [http://www.cs.jhu.edu/~jason/papers/eisner.coling96.pdf Three New Probabilistic Models for Dependency Parsing: An Exploration] and also described in [http://www.cs.jhu.edu/~jason/papers/eisner.iwptbook00.pdf Eisner 2000 Bilexical Grammars and Their Cubic-Time Parsing Algorithms]. |
== Definition == | == Definition == | ||
Revision as of 00:25, 26 November 2011
This method is a widely-used dynamic-programming algorithm, and the basis for many papers, that addresses the problem of Dependency Parsing. It was introduced by Jason Eisner in Eisner COLING 1996 Three New Probabilistic Models for Dependency Parsing: An Exploration and also described in Eisner 2000 Bilexical Grammars and Their Cubic-Time Parsing Algorithms.
Definition
bla bla
