prediction in chart parsing algorithms

... have mainly employed bottom- up parsing algorithms for processing. Conventional prediction techniques to improve the efficiency of the • parsing process, appear to fall short when parsing CUG. ... 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 ... only in this way the effect of top-down filtering will pay-off against the increased overhead of having to check the left-corner table. 6 Some Results The performance of the parsing algorithms...

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

... Survey of Rule-Invocation Strategies This section surveys the fundamental rule-invocation strategies in context-flee chart parsing. 3 In a chart- parsing framework, different rule-invocation strate- ... empirically. The experiments clearly indicate that it is possible to significantly increase efficiency in chart parsing by fine-tuning the rule-invocation strategy. Fine-tuning however also requires ... being generated, though. 228 Kay (1982) is the principal source, providing a very general exposition of the control strategies and data structures involved in chart parsing. In con- sidering...

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

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

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

... which can attach into other (mini)charts where combinations are 1In effect, hypotheticals belong on additional subor- derings, which can connect into the main ordering of the chart at various ... and so the indexing system allows the encoding of dominance relations. 4 A New Chart Parsing Method for Lambek Grammars 4.1 Lambek to SLMG Conversion The first task of the parsing approach ... present a new chart parsing method for Lambek grammars, inspired by a method for D- Tree grammar parsing. The formulae of a Lam- bek sequent are firstly converted into rules of an indexed grammar...

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

... crossing (s,t)}[ : the number of constituents in TG correct according to Consistent Brackets. Following are the definitions of the six metrics used in this paper for evaluating binary branching ... grammar with nonterminals not comparable to those in the training, a different experiment is needed to evaluate the Labelled Recall Algorithm, one in which the nonterminals in the induced grammar ... nonterminals in the test set. 5.2.1 Grammar Induction by Counting For this experiment, a very simple grammar was induced by counting, using a portion of the Penn Tree Bank, version 0.5. In particular,...

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

... entropy model for part-of- sp e e c h tagging. In Proc. EMNLP. B. Taskar, D. Klein, M. Collins, D. Koller, and C. Man- ning. 2004. Max-margin parsing. In Proc. EMNLP. H. Yamada and Y. Matsumoto. ... large-margin dependency 2 We are not concerned with violating the tree constraint. parsing. As usual for supervised learning, we as- sume a training set T = {(x t , y t )} T t=1 , consist- ing of ... are very promising and further show the robustness of discriminative on- line learning with approximate parsing algorithms. 6 Discussion We described approximate dependency parsing al- gorithms...

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

... collaborative- filtering techniques. In content-based filtering, we solve the problem of data sparsity in online con- tent by smoothing using latent topic information. In collaborative filtering, we model ... mutual information between users after doing an average-link clustering on their pairwise mutual information. In a clean clustering, intra- cluster mutual information should be high, while inter-cluster ... using the bag-of-word model since that would require the exact words to appear in the training set. In order to take advantage of the topic level in- formation while not losing the “fine-grained”...

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

... Klein and Christopher D. Manning. 2003a. Ac- curate unlexicalized parsing. In Proceedings of the 41st Annual Meeting of the Association for Com- putational Linguistics, pages 423–430. Dan Klein ... D. Manning. 2003b. Fast exact inference with a factored model for natural language parsing. In Advances in Neural Informa- tion Processing Systems, volume 15. MIT Press. Ravi Kumar, Jasmine Novak, ... are not used in our classification experiments. We then pruned the list of interests by excluding any interest that occurred within a +/-10 window (based on its position in the list) in multiple...

Ngày tải lên: 07/03/2014, 22: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 ... & Norvig, 1995). 3 Training Method 3.1 General Setting Our training set I consists of candidate inferences from the parse trees in the training data. From each training inference i ∈ I we generate ... development set as training progressed. Even though the baseline training made progress more quickly than the kitchen sink, the kitchen sink’s F 1 surpassed the baseline’s F 1 early in training, and at 6.3K...

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

... 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- fering senses in the (parsing) literature. ... gives a brief outline of the combined interactive and incremental parsing system, and section 5 summarizes the con- clusions. 2 Incremental Chart Parsing 2.1 Chart Parsing The incremental parser ... algorithm for incremental chart parsing, outlines how this could be embed- ded in an interactive parsing system, and discusses why this might be useful. Incremental parsing here means that input...

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

... beneveling. After likelihood determination and or- dering of the two remaining analyses in (8), the cor- rect analysis be + nevel + ing is in topmost position: (14) 1 be -t- nevel 4- ing N ... Head Rule be combined into a word of category B 4. In addition to this general rule for com- pounding, the grammar contains a small set of rules defining productive compounding. An analysis ... tion) is shown in (3)z: (3) a be + neef + eling b be+neef+e+ling c be + nevel + ing d been + e + veel + ing e be+n +e+veel+ing f be +neef + eel + ing All of the parts in the segmentations...

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

... using Collin’s parser (Vadas and Curran, 2007c), but has yet to be analyzed for its effects on dependency parsing. Parsing is very early in the NLP pipeline. There- fore, improvements in parsing ... components instead of improperly being a leaf node. 5 Conclusion This paper has demonstrated the benefit of addi- tional noun phrase bracketing in training data for use in dependency parsing and machine ... Computational Linguistics Effects of Noun Phrase Bracketing in Dependency Parsing and Machine Translation Nathan Green Charles University in Prague Institute of Formal and Applied Linguistics Faculty...

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

... consider- able speedups. 1 Introduction The increasing demand for accuracy and ro- bustness for today’s unification-based gram- mar parsers brings on an increasing demand for computing power. In addition, as ... Engineering, 6(1):1– 18. [Caroll1994] John Caroll. 1994. Relating complex- ity to practical performance in parsing with wide-coverage unification grammars. In Proc. of the 32 nd Annual Meeting ... non-empty. In this case, newWork will be set and step 2 is executed again. This cycle continues until all work is completed. The remaining steps serve several purposes: load balancing, preventing double...

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

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

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

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

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

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

Ngày tải lên: 03/05/2014, 13:55