efficient parsing for french
Báo cáo khoa học: "EFFICIENT PARSING FOR FRENCH*" potx
... 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...
- 8
- 333
- 0
Tài liệu Báo cáo khoa học: "Efficient Parsing for Bilexical Context-Free Grammar sand Head Automaton Grammars*" pptx
... 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...
- 8
- 409
- 0
Báo cáo khoa học: "Efficient Normal-Form Parsing for Combinatory Categorial Grammar*" pdf
... 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...
- 8
- 227
- 0
Tài liệu Báo cáo khoa học: "Quadratic-Time Dependency Parsing for Machine Translation" pdf
... of dependency parsing for Czech, (McDonaldet al., 2005b) even outperforms projective parsing, and was one of the top systems in the CoNLL-06shared task in multilingual dependency parsing. 2.1 ... of projectivedependency 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 machinetranslationIn this section, we review dependency parsing for- mulated as a maximum spanning tree problem(McDonald...
- 9
- 514
- 0
Tài liệu Báo cáo khoa học: "Head-Driven Parsing for Word Lattices" ppt
... 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 latticeswas not directly ... the overparsing extension can beseen in Table 1. Each of the PARSEVAL measuresimproves when overparsing is used.5.2 Parsing LatticesThe success of the parsing model as a languagemodel for speech ... and John-son (2003) and used the Treebank tokenization for measuring the WER. The model was tested with andwithout overparsing. parsing for speech recognition, discusses a mod-elling trade-off...
- 8
- 382
- 0
Tài liệu Báo cáo khoa học: "Deterministic shift-reduce parsing for unification-based grammars by using default unification" potx
... 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...
- 9
- 362
- 0
Báo cáo khoa học: "Efficient Search for Interactive Statistical Machine Translation" doc
... translations for large do-mains. Hence, in many applications, post-editing'The author is now affiliated with the Information ScienceInstitute, University of Southern California, och@isi.edu.of ... is an optimalheuristic function in the spirit of A* search. Hav-ing this information, we can compute efficiently for each node n in the graph the best successornode S (n):S(i) = argmax ... human user and compute thecorresponding extension. For the practicability ofthis approach, an efficient maximization in Eq. 3is very important. For the human user, a responsetime larger than...
- 8
- 272
- 0
Báo cáo khoa học: "Head-driven Parsing for Lexicalist Grammars: Experimental Results" ppt
... 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...
- 10
- 188
- 0
Báo cáo khoa học: "Probabilistic Parsing for German using Sister-Head Dependencies" docx
... 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 1showed, this cannot be taken for granted.7 ConclusionsWe presented the first probabilistic full parsing model for German trained ... attemptto develop a probabilistic full parsing model for Ger-man trained on a treebank (to our knowledge).Lexicalization can increase parsing performancedramatically for English (Carroll and Rooth,...
- 8
- 244
- 0
Báo cáo khoa học: "Robust, Finite-State Parsing for Spoken Language Understanding" pdf
... 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...
- 6
- 236
- 0
Báo cáo khoa học: "The Treegram Index An Efficient Technique for Retrieval in Linguistic Treebanks" docx
... 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...
- 2
- 327
- 0
Báo cáo khoa học: "Semi-Supervised Frame-Semantic Parsing for Unknown Predicates" doc
... powerful. For unknown targets, the gains of our approachare impressive: 15.7% absolute accuracy improve-ment over SEMAFOR for frame identification, and13.7% absolute F1improvement over SEMAFOR for ... iterativeprocedure starts with a uniform distribution for eachq(0)t. For all our experiments, we run 10 iterationsof the updates. The final distribution of frames for atarget t is denoted by q∗t.5 ... 13.7%are observed for frame identification and full frame-semantic parsing, respectively, indicating improvedcoverage for hitherto unobserved predicates (§6).2 BackgroundBefore going into the...
- 10
- 214
- 0
Báo cáo khoa học: "Bi-Directional Parsing for Generic Multimodal Interaction" pot
... 85–90,Sydney, July 2006.c2006 Association for Computational LinguisticsClavius: Bi-Directional Parsing for Generic Multimodal InteractionFrank RudziczCentre for Intelligent MachinesMcGill UniversityMontr´eal, ... theability to constrain the search using cross-modalinformation as early as possible.CLAVIUS is the result of an effort to combinesensing technologies for several modality types,speech and video-tracked ... Chicago, IL.Rocio, V., Lopes, J.G. 1998 Partial Parsing, Deduction and Tabling in TAPD 98Tomita, M. 1985 An Efficient Context-Free Parsing Algorithm for Natural Languages, in Proc. NinthIntl. Joint...
- 6
- 222
- 0
Báo cáo khoa học: "Parsing for Semidirectional Lambek Grammar is NP-Complete" doc
... 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...
- 6
- 122
- 0
Báo cáo khoa học: "Towards efficient parsing with proof-nets" pdf
... 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...
- 8
- 219
- 0
- for a n efficient contextfree parser augmented
- efficient technique for retrieval
- an efficient parsing algorithm
- probabilistic parsing for german
- semanticsdriven shallow parsing for chinese semantic role labeling
- an efficient algorithm for generating classification rules
- learning materials for french language
- an efficient method for determining bilingual word classes och
- an efficient method for determining bilingual word classes
Tìm thêm: hệ việt nam nhật bản và sức hấp dẫn của tiếng nhật tại việt nam xác định các nguyên tắc biên soạn khảo sát chương trình đào tạo của các đơn vị đào tạo tại nhật bản xác định thời lượng học về mặt lí thuyết và thực tế điều tra đối với đối tượng giảng viên và đối tượng quản lí điều tra với đối tượng sinh viên học tiếng nhật không chuyên ngữ1 khảo sát thực tế giảng dạy tiếng nhật không chuyên ngữ tại việt nam khảo sát các chương trình đào tạo theo những bộ giáo trình tiêu biểu xác định mức độ đáp ứng về văn hoá và chuyên môn trong ct phát huy những thành tựu công nghệ mới nhất được áp dụng vào công tác dạy và học ngoại ngữ mở máy động cơ lồng sóc các đặc tính của động cơ điện không đồng bộ đặc tuyến hiệu suất h fi p2 đặc tuyến mômen quay m fi p2 động cơ điện không đồng bộ một pha sự cần thiết phải đầu tư xây dựng nhà máy thông tin liên lạc và các dịch vụ từ bảng 3 1 ta thấy ngoài hai thành phần chủ yếu và chiếm tỷ lệ cao nhất là tinh bột và cacbonhydrat trong hạt gạo tẻ còn chứa đường cellulose hemicellulose chỉ tiêu chất lượng theo chất lượng phẩm chất sản phẩm khô từ gạo của bộ y tế năm 2008 chỉ tiêu chất lượng 9 tr 25