highly constrained unification grammars
Báo cáo khoa học: "Highly constrained unification grammars" potx
... unification grammars which dramatically limit their expressivity. We prove that non-reentrant unification grammars generate exactly the class of context-free languages; and that one-reentrant unification ... definition of constraints on unification grammars that would generate all the classes of the hierarchy. Another direction is an extension of one-reentrant unification grammars, where the reentrancy ... 1089–1096, Sydney, July 2006. c 2006 Association for Computational Linguistics Highly constrained unification grammars Daniel Feinstein Department of Computer Science University of Haifa 31905...
Ngày tải lên: 23/03/2014, 18:20
Báo cáo khoa học: "Practical Issues in Compiling Typed Unification Grammars for Speech Recognition" ppt
Ngày tải lên: 31/03/2014, 04:20
Báo cáo khoa học: "Dynamic programming for parsing and estimation of stochastic unification-based grammars∗" pot
Ngày tải lên: 31/03/2014, 06:20
Báo cáo khoa học: "Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification" pptx
... Parallel unification exploits parallelism inherent of graph unification itself, whereas concurrent unification exploits parallelism at the context-free grammar backbone. As long as the number of unification ... graph unification remains the most ex- pensive component in unification- based gram- mar parsing. Unification is a well known algo- rithm. Prolog, for example, makes extensive use of term unification. ... quasi-destructive graph unification algorithm as the starting point (Tomabechi, 1995), because it is often considered to be the fastest unification algo- Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification Marcel...
Ngày tải lên: 31/03/2014, 04:20
Báo cáo khoa học: "Regular tree grammars as a formalism for scope underspecification" docx
... produced by current grammars are nets (Flickinger et al., 2005). For the rest of the pa- per, we restrict ourselves to dominance graphs that are hypernormally connected. 3 Regular tree grammars We will ... more details. The languages that can be accepted by regular tree grammars are called regular tree languages (RTLs), and regular tree grammars are equivalent to regular 219 system. For example, G ... intersection, union, and com- plement, and so forth. 3.2 Regular tree grammars in underspecification We can now use regular tree grammars in underspeci- fication by representing the semantic representations as...
Ngày tải lên: 23/03/2014, 17:20
Báo cáo khoa học: Identification of an atypical insect olfactory receptor subtype highly conserved within noctuids potx
... cloning strategies to identify a new moth subtype of highly conserved candi- date ORs, the OR18 subtype. Six full-length cDNAs encoding ORs highly related to the H. virescens OR18 [11] were identified ... mosquito, Aedes aegypti, that is highly conserved and expressed in olfactory and gustatory organs. Chem Senses 29, 403–410. 22 Pitts RJ, Fox AN & Zwiebel LJ (2004) A highly conserved candidate ... Identification of an atypical insect olfactory receptor subtype highly conserved within noctuids Isabelle Brigaud 1 , Nicolas Montagne ´ 2 , Christelle Monsempes 1 ,...
Ngày tải lên: 29/03/2014, 22:21
Một số giải pháp thúc đẩy hoạt động tiêu thụ sản phẩm thời trang công sở UNI của Công Ty TNHH Thời Trang – Mỹ Phẩm Vĩnh Thịnh.doc
Ngày tải lên: 23/09/2012, 11:49
Heavy metal cation retention by unconventional sorbents (red muds and fly ashes)
Ngày tải lên: 23/09/2012, 14:47
Khảo sát, nghiên cứu, xác định hàm lượng các cation kim loại nặng trong nước thải và nước sinh hoạt bằng phương pháp von - ampe hòa tan anot xung vi phân
Ngày tải lên: 09/11/2012, 09:51
KHẢO SÁT, NGHIÊN CỨU, XÁC ĐỊNH HÀM LƯỢNG CÁC CATION KIM LOẠI NẶNG TRONG NƢỚC THẢI VÀ NƯỚC SINH HOẠT BẰNG PHƯƠNG PHÁP VON - AMPE HÒA TAN ANOT XUNG VI PHÂN
Ngày tải lên: 14/04/2013, 17:20
Bạn có muốn tìm thêm với từ khóa: