Báo cáo khoa học: "Interactive Incremental Chart Parsing" ppt

... system, and section 5 summarizes the con- clusions. 2 Incremental Chart Parsing 2.1 Chart Parsing The incremental parser has been grounded in a chart- parsing framework (Kay 1980, Thompson 1981, ... Algorithm for Incremental Chart Parsing 2.4.1 Introduction This section states an algorithm for incremental chart parsing, divided into update routines, subrou- tines, an...

Ngày tải lên: 09/03/2014, 01:20

... can in principle be used to parse CUG. A chart- parser scans a sentence from left to right, while entering items, representing (partial) derivations, in a chart. Assume that items are represented ... backtrack. Minimal use is made of a chart (in which successful and failed parse attempts are stored). Our algo- rithm assigns a more important role to the chart and thus avoids ba...

Ngày tải lên: 18/03/2014, 02:20

Ngày tải lên: 22/02/2014, 03:20

Ngày tải lên: 08/03/2014, 18:20

... Annual Meeting of the ACL [2], pages 106-113. [Shann, 1991] P. Shann. Experiments with GLR and chart parsing. In [Tomita, 1991], chapter 2, pages 17-34. [Sheil, 1976] B.A. Sheil. Observations ... Twente, November 1990. [Sikkel and Op den Akker, 1992] K. Sikkel and R. op den Akker. Head-corner chart parsing. In Computing Science in the Netherlands, Utrecht, November 1992. [Slocu...

Ngày tải lên: 01/04/2014, 00:20

Ngày tải lên: 20/02/2014, 04:20

... parser and the chart- based C&C parser offer two different solutions to the CCG pars- ing problem. The comparison reported in this sec- tion is similar to the comparison between the chart- based ... using a discriminative model and beam search, and compare its strengths and weaknesses with the chart- based C&C parser. We study different errors made by the two parsers, and show tha...

Ngày tải lên: 20/02/2014, 04:20

Ngày tải lên: 20/02/2014, 07:20

... reliance on a dynamic- programming or chart parsing algorithm such as CKY or Earley. Adapting the approach of Mc- Donald et al. (2005b) for machine translation, we incrementally build dependency structure ... quadratic-time depen- dency parsing algorithm that is just 0.7% less ac- curate than “full-fledged” chart parsing (which, in the case of dependency parsing, runs in time O(n 3 ) (Eisn...

Ngày tải lên: 20/02/2014, 07:20

Ngày tải lên: 20/02/2014, 09:20