Báo cáo khoa học: "Prediction in Chart Parsing Algorithms for Categorial Unification Grammar" pdf

... Prediction in Chart Parsing Algorithms for Categorial Unification Grammar Gosse Bouma Computational Linguistics Department University of Groningen, P.O. box 716 NL-9700 AS Groningen, The ... prediction technique for CUG and show thai this may lead to considerable gains in efficiency for both bottom-up and top-down parsing. 1 Preliminaries CATEGORIAL UNIFICATION...

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

... training speed of discrimina- tive parsing. Our discriminative parsing method has no generative component, yet surpasses a generative baseline on con- stituent parsing, and does so with mini- mal ... regularization penalty by decreasing λ (Steps 1.6 and 1.7) and continue training. In this way, instead of choosing the best λ heuristically, we can optimize it during a single training run...

Ngày tải lên: 08/03/2014, 02:21

... Algorithm for Incremental Chart Parsing 2.4.1 Introduction This section states an algorithm for incremental chart parsing, divided into update routines, subrou- tines, and an underlying chart ... chart parsing and to outline how this could be embedded in an interactive parsing system. 1.2 Incremental Parsing The word "incremental ~ has been used in two dif-...

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

... receive an analysis from both parsers. Training Time Parsing Time Training RAM Parser in CPU minutes in CPU minutes in gigabytes Clark and Curran Normal Form Model 1152 2 28 Clark and Curran Hybrid ... by performing a fixed number of iterations of splitting, merging and smoothing. The splitting process is done by performing Expectation-Maximization to de- termine a likely potential spl...

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

... entries during parsing. 1 Introduction The LR method is known to be a very efficient parsing algorithm that involves no searching or backtracking. However, recent formalisms for syntactic ... tables during preprocessing. 5: Further Comparisons and Conclusion The LR parsing algorithm for grammars with atomic categories involves no category matching during parsing. In Fig...

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

... training set, hence in a different “domain” (in a loose sense). The typical cause of this is that the model overfits the training domain. The concerns over random choice of training corpus leading ... question answering, information ex- traction, etc.). In combination with machine learn- ing methods, several statistical dependency pars- ing models have reached comparable high parsing ac...

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

... NP-hardness result for a grammar fac- torization problem, which we hope will aid in under- standing parsing algorithms in general. 2 LCFRSs and parsing complexity In this section we briefly introduce LCFRSs ... an algorithm for finding the best parsing strategy, and Huang et al. (2009) mention that whether finding the optimal parsing strategy for an SCFG rule is NP- hard is...

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

... (Collins, 2002) for global learning and beam- search for decoding. Unlike both earlier global- learning parsers, which only perform unlabeled parsing, we perform labeled parsing by augmenting the ... parsing. In Pro- ceedings of ACL/HLT, pages 595–603, Columbus, Ohio, June. Andre Martins, Noah Smith, and Eric Xing. 2009. Con- cise integer linear programming formulations for de- pe...

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

... together, i.e., coming from the same tuple instance. For our parsing algo- rithm, we want to avoid grouping the instances of elementary trees in a derivation tree into tu- ple instances. In other words, ... node.  4 Parsing algorithm In this section we present a recognition algorithm for TT-MCTAG working in polynomial time in the size of the input string. The algorithm can...

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

... semantics are given in (Saint-Dizier 1988b), computer applications like compiler writing and planning are given in (Saint-Dizier 1988a), its use in natural language parsing for free-phrase order ... computational model for movement theory in Government and Binding Theory. For that purpose, we have designed a language called DISLOG. DISLOG stands for programming in lo...

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