CYK algorithm: Difference between revisions

Revision as of 06:18, 26 June 2006

Revision as of 03:19, 1 September 2006

Line 63:

* T. Kasami (1965). An efficient recognition and syntax-analysis algorithm for context-free languages. Scientific report AFCRL-65-758, Air Force Cambridge Research Lab, Bedford, MA.

* Daniel H. Younger (1967). Recognition and parsing of context-free languages in time ''n''³. ''Information and Control'' 10(2): 189–208.

* Víctor M. Jiménez and András Marzal (2000). [http://terra.act.uji.es/~vjimenez/sspr2000.ps Computation of the N best parse trees for weighted and stochastic context-free grammars]. Proc. SSPR/SPR 2000, Lecture Notes in Computer Science 1876: 183–192.

* Dan Klein and Chris Manning (2001). [http://nlp.stanford.edu/~manning/papers/klein_and_manning-parsing_and_hypergraphs-IWPT_2001.pdf Parsing and Hypergraphs]. Proc. of IWPT 2001.

* Liang Huang and David Chiang (2005). [http://acl.ldc.upenn.edu/W/W05/W05-1506.pdf Better k-best Parsing]. Proc. of IWPT 2005.

[[Category:Parsing algorithms]]