an earlytype parsing algorithm for tree adjoining grammars
Báo cáo khoa học: "An Earley Parsing Algorithm for Range Concatenation Grammars" potx
... Parmentier, and Johannes Dellert. 2008. De-veloping an MCTAG for German with an RCG-based parser. In Proceedings of LREC-2008, Mar-rakech, Morocco.Wolfgang Maier and Anders Søgaard. 2008. Tree- banks ... Guided parsing of Range Concatenation Languages. In Pro-ceedings of ACL, pages 42–49.Tilman Becker, Aravind K. Joshi, and Owen Rambow.1991. Long-distance scrambling and tree adjoining grammars. ... adjacentvariables can be concatenated), it is called an in-stantiated predicate and the result of applying φ toall predicates in c, if defined, is called an instanti-ated clause.We also introduce range...
- 4
- 354
- 0
Tài liệu Báo cáo khoa học: "BIDIRECTIONAL PARSING OF LEXICALIZED TREE ADJOINING GRAMMARS" pdf
... Hungary. Schabes, Yves and Joshi, Aravind K., 1988. An Earley-Type Parsing Algorithm for Tree Adjoining Grammars. In Proceedings of the 26th Annual Meeting of the Association for Computational ... grammar filtering and bottom-up information. In fact, such an algorithm starts partial analyses from the anchor elements, di- rectly selecting the relevant trees in the grammar, and then it proceeds ... additional information, it is not difficult to exhibit an algorithm for the construction of the desired parser(s). References Harbusch, Karin, 1990. An Efficient Parsing Algorithm for TAGs....
- 6
- 370
- 0
Tài liệu Báo cáo khoa học: "AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES " pot
... Aho and Ullman (1987) and Aho and Johnson (1974), and more formal definitions and notations of a feature- based grammar formalism from Pollard and Sag (1987) and Shieber (1986). 2 The LR Parsing ... AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES Tsuneko Nakazawa Beckman Institute for Advanced Science and Technology and Linguistics ... Carl and Ivan A. Sag 1987. Information-Based Syntax and Semantics VoI.1. CSLI Lecture Notes 13. Stanford: CSLI. Shieber, S. 1985. "Using Restriction to Extend Parsing Algorithms for...
- 6
- 334
- 0
Tài liệu Báo cáo khoa học: "Some Novel Applications of Explanation-Based Learning to Parsing Lexicalized Tree-Adjoining Grammars"" doc
... Explanation-Based Learning to Parsing Lexicalized Tree- Adjoining Grammars& quot; B. Srinivas and Aravind K. Joshi Department of Computer and Information Science University of Pennsylvania ... locality over which the anchor can specify syntactic and semantic (predicate-argument) constraints. Elementary trees are of two kinds - (a) INITIAL TREES and (b) AUX- ILIARY TREES. Nodes on the ... attach- ments and performs term unification thus generating all the derivation trees. The "stapler" uses both the elementary tree assignment information and the de- pendency information...
- 8
- 388
- 0
Báo cáo khoa học: "A Tree Transducer Model for Synchronous Tree-Adjoining Grammars" pdf
... all tree- adjoining grammars (and synchronous tree- adjoining grammars) . A tree- adjoining grammar (TAG) is a finite set ofinitial trees and a finite set of auxiliary trees. Our1070 Jonathan Graehl, ... STAG,which can be useful for certain constructions. It isknown that an embedded tree transducer (Shieber,2006) can handle the mentioned un -parsing step. An extended embedded tree transducer with9cis ... regular tree language andtwo embedded tree transducers (instead of two tree homomorphisms). Such embedded tree transduc-ers (Shieber, 2006) are particular macro tree trans-ducers (Courcelle and...
- 10
- 294
- 0
Báo cáo khoa học: "Parsing preferences with Lexicalized Tree Adjoining Grammars : exploiting the derivation tree" pptx
... Parsing preferences with Lexicalized Tree Adjoining Grammars : exploiting the derivation tree Alexandra KINYON TALANA Universite Paris 7, case 7003, 2pl Jussieu 75005 Paris France Alexandra.Kinyon@linguist.jussieu.fr ... tree is semantically void ã Semantic minimality : an elementary tree corresponds at most to one semantic unit 2. Former results on parsing preferences A vast literature addresses parsing preferences. ... (noted $). These trees are of 2 types • auxiliary or initial 2. A tree has at most 1 foot-node, such a tree is an auxiliary tree. Trees that are not auxiliary are initial. Elementary trees combine...
- 6
- 301
- 0
Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx
... for composing trees. Many modern types of TAG also allow tree substitution next to adjunc- tion. Our algorithm can be straightforwardly extended to handle tree substitution. The main changes ... D-66123 Saarbr/icken, Germany E-marl: nederhof@dfki.de Abstract We present a new LR algorithm for tree- adjoining grammars. It is an alternative to an existing algorithm that is shown to ... grammar parsing. The best-known example is generalized LR parsing (Tomita, 1986). A first attempt to adapt LR parsing to tree- adjoining grammars (TAGs) was made by Scha- bes and Vijay-Shanker...
- 7
- 413
- 0
Tài liệu Báo cáo khoa học: "Prefix Probabilities from Stochastic Tree Adjoining Grammars*" pptx
... NSF grant SBR8920230 and ARO grant DAAH0404-94- G-0426. The authors wish to thank Aravind Joshi for his support in this research. ural language would improve performance of such language ... function P can be computed independently of the actual input. For any i < n we can consistently define the following quantities, where t E Z U.4 and a E V ± or cdn(N) = aft for some N and fl: ... set of initial trees and .A is a set of auxiliary trees. Trees in :TU.A are also called elementary trees. We refer to the root of an elementary tree t as Rt. Each auxiliary tree has exactly...
- 7
- 311
- 0
Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt
... wish to thank our colleagues Kerima Benkerimi, David Elworthy, Peter Gibbins, Inn Johnson, Andrew Kay and Antonio Sanfilippo at SLE, and our anonymous reviewers for useful feedback and discussions ... as translation coverage is extended and new lan- guage pairs are added. 5 Conclusion We have presented a polynomial complexity gener- ation algorithm which can form part of any Shake- and-Bake ... component has performed consistently better. References V. Allegranza, P. Bennett, J. Durand, F. van Eynde, L. Humphreys, P. Schmidt, and E. Steiner. 1991. Linguistics for Machine Translation:...
- 7
- 410
- 0
Tài liệu Báo cáo khoa học: "Long-Distance Scrambling and Tree Adjoining Grammars" doc
... Grammar Formalisms. PhD thesis, Department of Computer and Information Science, Uni- versity of Pennsylvania. - 26 - Long-Distance Scrambling and Tree Adjoining Grammars* Tilman Becker~ ... partment of Computer and Information Science, Univer- sity of Pennsylvania. [Kroch and Joshi 1:986] Kroch, Anthony and Joshi, At- avind K., 1986. Analyzing extraposition in a Tree Adjoining Grammar. ... in Korean. In Kuno, Susumo; Whit- man, John; Lee, Ik-Hwan; and Kang, Young-Se (edi- tors), Harvard Studies in Korean Linguistics. Hanshin Publishing Company, Seoul, Korea. [Rainbow and Becker...
- 6
- 297
- 0
Báo cáo khoa học: "Strong Lexicalization of Tree Adjoining Grammars" docx
... Takahashi.1975. Tree adjunct grammars. J. Comput. System Sci.,10(1):136–163.Aravind K. Joshi and Yves Schabes. 1992. Tree- adjoining grammars and lexicalized grammars. InMaurice Nivat and Andreas ... editors, Tree Au-tomata and Languages. North-Holland.Aravind K. Joshi and Yves Schabes. 1997. Tree- adjoining grammars. In Grzegorz Rozenberg and ArtoSalomaa, editors, Beyond Words, volume 3 of Hand-book ... The equiv-alence of tree adjoining grammars and monadic lin-ear context-free tree grammars. J. Log. Lang. Inf.,20(3):361–384.Ines Klimann, Sylvain Lombardy, Jean Mairesse, andChristophe Prieur....
- 10
- 322
- 0
Báo cáo khoa học: "AN ISLAND PARSING INTERPRETER FOR THE FULL AUGMENTED TRANSITION NETWORK FORMALISM" potx
... Bran Boguraev for his guidance during the writing of the interpreter, and for supplying the ATN grammars I have used. Thanks also to Karen Sparck Jones and John Tait for their comments on earlier ... " ;An Island Parsing Interpreter for Augmented Transition Networks". University of Cambridge Computer Laboratory Technical Report No .33. Woods, W. (1970) "Transition Network Grammars ... clauses in an island parsing ATN interpreter: if an action (LIFTR <register> ) occurs in a sub-network, any action using that register in any higher sub-network that PUSHes for the one...
- 5
- 276
- 0
Báo cáo khoa học: "An Open Source Toolkit for Tree/Forest-Based Statistical Machine Translation" ppt
... (Chiang, 2005), tree- tree (Ding andPalmer, 2005) and tree/ forest-string (Galley et al.,2004; Mi and Huang, 2008; Wu et al., 2011a)data structures. Leveraging structural and linguis-tic information ... Australia.Yang Liu, Yajuan Lău, and Qun Liu. 2009a. Improving tree- to -tree translation with packed forests. In Pro-ceedings of ACL-IJCNLP, pages 558–566, August.Yang Liu, Haitao Mi, Yang Feng, and ... Decoding Rules Parser tree- to -tree (Ding and Palmer, 2005) ↓ dep to-dep. DGforest-to -tree (Liu et al., 2009a) ↓ ↑↓ tree- to -tree PCFG tree- to-string (Liu et al., 2006) ↑ tree- to-string PCFG(Quirk...
- 6
- 347
- 0
Báo cáo khoa học: "Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierarchy" potx
... inheritance (thus, for example, VPTREE inherits from TREENODE, STREE and NPCOMP) but a/l such multiple inheritance is orthogonal in DATR: no path can inherit from more than one node. trees ... trees (typically around 20) drawn from a set of over 500 elementary trees. Many of these trees have structure in common, many of the lexemes have the same tree families, and many of the trees ... semantics and lexical semantics 3. Third, one can exploit existing formal and implementation work on the language 4. 2 Representing LTAG trees S NPI VP V o NPI PP P o NPI Figure 1: An...
- 8
- 349
- 0
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 gắn với các giáo trình cụ thể 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í 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 nội dung cụ thể cho từng kĩ năng ở từng cấp độ mở máy động cơ lồng sóc mở máy động cơ rôto dây quấn các đặc tính của động cơ điện không đồng bộ hệ số công suất cosp fi p2 đặc tuyến hiệu suất h fi p2 đặc tuyến mômen quay m fi p2 đặc tuyến tốc độ rôto n fi p2 đặc tuyến dòng điện stato i1 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ụ phần 3 giới thiệu nguyên liệu