Báo cáo khoa học: "Efficient Normal-Form Parsing for Combinatory Categorial Grammar*" pdf

... shared for- est is build that encodes the set of all derivation trees for the input string. This shared forest is then pruned to remove all spurious ambiguity. 1 Introduction Combinatory Categorial ... for shared forests. In our case, the gram- mars we produce may also be viewed as acyclic and-or graphs which is the more standard representation used for shared forests. The gr...

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

... basis of sequent calculus. The category formulas are freely generated from atomic category formulas (e.g. N for referring nom- inals, S for sentences, CN for common nouns, ) by binary operators ... empty string. Each category formula A is interpreted as a subset D(A) of L. Given such a mapping for atomic category formu- las it is extended to the compound category formulas thu...

Ngày tải lên: 24/03/2014, 05:21

... Efficient Normal-Form Parsing for Combinatory Categorial Grammar* Jason Eisner Dept. of Computer and Information Science University of Pennsylvania 200 ... paper addresses the problem for a fairly general form of Combinatory Categorial Grammar, by means of an efficient, correct, and easy to implement normal-form parsing tech- nique. The parser ... semantic reading...

Ngày tải lên: 23/03/2014, 20:21

... beam function, base beam value) for pars- ing using development test data consisting of strings for which we have annotated parse trees. The parsing accuracy for parsing word lattices was not directly ... the overparsing extension can be seen in Table 1. Each of the PARSEVAL measures improves when overparsing is used. 5.2 Parsing Lattices The success of the parsing model as a la...

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

... argues that head-corner parsing is especially useful for parsing with non-concatenative grammar formalisms. In [Lavelli and Satta, 1991] a head-driven parsing strategy for Lexicalized Tree Adjoining ... step, thus leading to inferior performance. Bottom-up parsing is far more attractive for lexi- calist formalisms, as it is driven by the syntactic in- formation associate...

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

... 85–90, Sydney, July 2006. c 2006 Association for Computational Linguistics Clavius: Bi-Directional Parsing for Generic Multimodal Interaction Frank Rudzicz Centre for Intelligent Machines McGill University Montr ´ eal, ... the ability to constrain the search using cross-modal information as early as possible. CLAVIUS is the result of an effort to combine sensing technologies for se...

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

... ones for which the trigram model performs better, and the ones for which the grammar model does better. We then collect labeled precision and recall statistics (the stan- dard parsing performance ... 137.26 for the Roark parser/trigram combination). In both papers the interpolation constants were 0.36 for the trigram estimate and 0.64 for the grammar estimate. While both of these...

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

... 1983) and can be used for grammars written in power- ful formalisms such as non-concatenative versions of HPSG (Pollard, 1984; Reape, 1989). 1 Introduction Although most formalisms in computational ... order to be used for this larger class of grammars. The disadvan- tages Kay noted for his parser do not carry over to this generalized version, as redundant search paths for CF...

Ngày tải lên: 31/03/2014, 06:20

... function, defined as R : S × A → , R(s, a) encodes the utility for the agent to perform the action a while in state s. It is therefore a model for the goals or preferences of the agent. A graphical illustration ... 2010. c 2010 Association for Computational Linguistics Towards Relational POMDPs for Adaptive Dialogue Management Pierre Lison Language Technology Lab German Research Cent...

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

... p null = 10 −10 for this value in the experiments we report below. 784 either φ P z i for phrase pairs or φ null for single lan- guage phrases. We choose Dirichlet process (DP) priors for these parameters: φ P z i ∼ ... proce- dure for each sentence pair is non-trivial, prov- ing NP-complete for learning phrase based models (DeNero and Klein, 2008) or a high order poly- nomial (O(...

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