efficient parsing for french

... triplets of the form [Edge,pX.Val] and Edge indicates an argument edge with which the functor edge has combined by consuming valency Val of the predicate pX label- EFFICIENT PARSING FOR FRENCH* Claire ... completeness of parsing are proved. INTRODUCTION Our aim is twofold. First to provide a linguistical- ly well motivated categorial grammar for French (henceforth, FG) which accounts for word order ... precompiled before parsing and the number of rules increases rapidly or LP statements are checked on the fly during parsing thus slowing down proces- sing. 2. THE GRAMMAR The formal characteristics...

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

... techniques for cheaply attaching head information to deriva- tions can also be exploited in parsing formalisms other than rewriting systems. The authors have developed an O(nT)-time parsing ... We present O(n 4) parsing algorithms for two bilexical formalisms, improv- ing the prior upper bounds of O(n5). For a com- mon special case that was known to allow O(n 3) parsing (Eisner, ... of the reversed Markov chain. 461 Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars* Jason Eisner Dept. of Computer ~ Information Science University of Pennsylvania...

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

... con- straints by tagging chart entries. Efficient Normal-Form Parsing for Combinatory Categorial Grammar* Jason Eisner Dept. of Computer and Information Science University of Pennsylvania ... 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 ... least for some fragments of CCG, but leave the proof to future work. These normal-form results for pure CCG lead di- rectly to useful parsers for real, restricted CCG grammars. Two parsing...

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

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

... of dependency parsing for Czech, (McDonald et al., 2005b) even outperforms projective parsing, and was one of the top systems in the CoNLL-06 shared task in multilingual dependency parsing. 2.1 ... of projective dependency trees, would yield poor performance. That is not the case: dependency accuracy for non- projective parsing is 90.2% for English (McDon- ald et al., 2005b), only 0.7% lower ... statis- tically very significant (p ≤ .01). 2 Dependency parsing for machine translation In this section, we review dependency parsing for- mulated as a maximum spanning tree problem (McDonald...

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

... 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 language model for speech ... and John- son (2003) and used the Treebank tokenization for measuring the WER. The model was tested with and without overparsing. parsing for speech recognition, discusses a mod- elling trade-off...

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

... performance, with an LF of around 88.5%, in the settings of parsing time less than 500ms/sentence for Section 22. For comparison with previous studies using the packed parse forest, the performances ... between LF and parsing time for the development set (Section 22, gold POS). As seen in the figure, the LF increased as the parsing time increased. The increase in LF for determi- nistic parsing without ... shift-reduce pars- ing approach for unification-based grammars without the mechanisms of the packed parse for- est. Shift-reduce parsing for CFG and dependen- cy parsing have recently been studied...

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

... translations for large do- mains. Hence, in many applications, post-editing 'The author is now affiliated with the Information Science Institute, University of Southern California, och@isi.edu . of ... is an optimal heuristic function in the spirit of A* search. Hav- ing this information, we can compute efficiently for each node n in the graph the best successor node S (n): S(i) = ar g max ... human user and compute the corresponding extension. For the practicability of this approach, an efficient maximization in Eq. 3 is very important. For the human user, a response time larger than...

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

... 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 ... (bidirectional) head-corner parsing, in which a bottom-up parsing strategy is guided by top-down prediction, is more efficient than pure bottom-up parsing as well as left-corner parsing. Before discussing ... bottom-up information. The top-down information is available through a left- corner resp. head-corner table, which turn out to be quite informative for this grammar. The head-corner parser performs...

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

... dependen- cies improve parsing performance not only for NPs (which is well-known for English), but also for PPs, VPs, Ss, and coordinate categories. The best perfor- mance was obtained for a model that ... really improves parsing performance for these languages. As Experiment 1 showed, this cannot be taken for granted. 7 Conclusions We presented the first probabilistic full parsing model for German trained ... attempt to develop a probabilistic full parsing model for Ger- man trained on a treebank (to our knowledge). Lexicalization can increase parsing performance dramatically for English (Carroll and Rooth,...

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

... Robust, Finite-State Parsing for Spoken Language Understanding Edward C. Kaiser Center for Spoken Language Understanding Oregon Graduate Institute PO ... and Wright (1997) have argued for the use of finite-state acceptors (FSAs) as an efficient means of integrating structural knowl- edge into the recognition process for limited do- main tasks. ... the ba- sis for language modeling, " means that in- formation about the probability of a rule apply- ing at a particular point in a parse derivation is lost" (1993). For this reason...

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

... ables, the index has to contain all matching treegrams for that subtree. (c) It is quite expensive to intersect the tree sets T(DB, g) for all treegrams g contained in the query q. VENONA ... the structure of word forms, feature terms should be used 1. (2) VENONA deals only with treegrams of a maximal degree d; if a tree is of greater degree, it will be transformed automati- cally ... g's structure completes this represen- tation: Structure is at least as essential for tree retrieval as label information. 1Due to lack of space, we cannot present our ex- tension of treegram...

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

... powerful. For unknown targets, the gains of our approach are impressive: 15.7% absolute accuracy improve- ment over SEMAFOR for frame identification, and 13.7% absolute F 1 improvement over SEMAFOR for ... iterative procedure starts with a uniform distribution for each q (0) t . For all our experiments, we run 10 iterations of the updates. The final distribution of frames for a target t is denoted by q ∗ t . 5 ... 13.7% are observed for frame identification and full frame- semantic parsing, respectively, indicating improved coverage for hitherto unobserved predicates (§6). 2 Background Before going into the...

Ngày tải lên: 23/03/2014, 16: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 several modality types, speech and video-tracked ... Chicago, IL. Rocio, V., Lopes, J.G. 1998 Partial Parsing, Deduction and Tabling in TAPD 98 Tomita, M. 1985 An Efficient Context-Free Parsing Algorithm for Natural Languages, in Proc. Ninth Intl. Joint...

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

... there will be. We can show Cut Elimination for this calculus by a straight-forward adaptation of the Cut elimination proof for L. We omit the proof for reasons of space. Proposition 1 (Cut ... abstracted-over formula to permute can be directly encoded in the right rule for o. 4 Note that our purpose for studying SDI_ is not that it might be in any sense better suited for a theory of ... that it is at the same time an SOL- grammar. 3 NP-Completeness of the Parsing Problem We show that the Parsing Problem for SDL- grammars is NP-complete by a reduction of the 3-Partition Problem...

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

... Towards efficient parsing with proof-nets Alain Lecomte GRIL Universit6 Blaise Pascal 63037-Clermont-Ferrand France email: lecomte@ shm.grenet.fr Abstract This paper presents a method for parsing ... classical chart- parsing. 1 Introduction In this paper, we present a method for parsing Lambek grammars based on graph-theoretic properties. We expect that it may be done efficiently by an ... Informatica, Amsterdam. [Roorda, 1992] Dirk Roorda. Proof Nets for Lambek Calculus, Journal of Logic and Computation, 2(2): 211-233. [Wansing, 1990] Heinrich Wansing. Formulaes-as- types for...

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

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

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

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

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