synchronous context free grammars

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

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

... Schabes, Yves and Richard C. Waters. 1993. Lex- icalized context- free grammar: A cubic-time parsable formalism that strongly lexicalizes context- free grammar. Technical Report 93- 04, Mitsubishi ... February. Vijay-Shanker, K. and David Weir. 1993a. The equivalence of four extensions of context- free grammars. To appear in Mathematical Sys- tems Theory. Vijay-Shanker, K. and [)avid Weir. ... aj+l'"ak "'" ak Figure 13: Sibling concatenation. 127 Lexicalized Context- Free Grammars Like an LTAG, an LC'FG consists of two sets of trees: initial trees, which...

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

... clarify the gen- erative capacities of such grammars and devices. Parallel multiple context- free grammars (pm- cfg's) and multiple context- free grammars (mcfg's) were introduced in ... are parallel multiple context- free grammars (pmcfg's) and lexical-functional gram- mars (lfg's). Pmcfg's and their subclass called multiple context- free grammars (mcfg's) ... (ed.), MIT press:173-281. Kasami, T. et al. 1988a. "Generalized Context- Free Grammars and Multiple Context- Free Grammars& quot;, Trans. IEICE, J71-D-I, 5:758-765. Kasami, T. et al. 1988b....

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

... Conclusion In this paper, we discussed several issues concerning decoding with synchronous context- free grammars, focusing on grammars resulting from the GHKM extraction method. We discussed different ... Earley. 1970. An efficient context- free parsing algo- rithm. Communications of the ACM, 6(8):451–455. Licheng Fang, Tagyoung Chung, and Daniel Gildea. 2011. Terminal-aware synchronous binarization. ... of eliminating problem- atic unary rules would be converting grammars into Chomsky normal form. However, this may result in bloated grammars. In this section, we present two different ways to...

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

... Italy satta@dei.unipd.it Abstract We consider the problem of parsing non-recursive context- free grammars, i.e., context- free grammars that generate finite languages. In natural language process- ing, this ... general context- free language and a regular language is still context- free. In the present paper we leave the theoretical framework of Bar-Hillel et al. (1964), and consider parsing grammars ... Following the ter- minology adopted above, this means that parsing a context- free input grammar on the basis of a context- free parsing grammar is not possible in general. One way to make the...

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

... 1970. An efficient context- free parsing algo- rithm. Communications of the ACM, 6(8):451-455. Susan L. Graham, Michael A. Harrison, and Walter L. Ruzzo. 1980. An improved context- freerecognizer. ... grammar. The algorithm was used successfully and found to be practical in dealing with context- free grammars and bigram models for a medium-scale speech recognition task, where it helped ... Lafferty. 1991. Computa- tion of the probability of initial substring generation by stochastic context- free grammars. Computational Lin- guistics, 17(3):315-323. Frederick Jelinek and Robert L. Mercer....

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

... described by polynomial-size ID/LP grammars. The results have im- plications for the description of free word order languages. 2 Introduction Context free grammars in immediate dominance and ... 48109 1 Abstract We prove in this paper that unordered, or ID/LP grammars, are e.xponentially more succinct than context- free grammars, by exhibiting a sequence (L,~) of finite languages such ... increasing context- free de- scriptions. ~Ve have the following theorem. Theorem 2 Consider the set Mn(n=) of all length n 2 strings of Mn. Then there is a constant c > 1 such that any context. free...

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

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

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, 06:20

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

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

Ngày tải lên: 13/05/2014, 10:21

... such subderivations into a full parse. 2 Notation for context- free grammars The reader is assumed to be familiar with context- free grammars. Our notation fol- 1Other relevant parsers simultaneously ... • For bilexicalized context- free grammars, O(n 4) is possible. • The O(n 4) result also holds for head au- tomaton grammars. • For a very common special case of these grammars where an O(n ... the natural formalism of bilexical context- free grammar, and for AI- shawi's (1996) head automaton grammars. For the usual case, split head automaton grammars or equivalent bilexical CFGs,...

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

... which run different types of grammars. Among them, the most successful are the CF grammars, the augmented phrase-structure grammars (APSGs), and the semantic grammars. All of them have different ... Cognitive Process. VoI.I: Syntax. Addison-Wesley. 202 AN EFFICIENT CONTEXT- FREE PARSER FOR AUGMENTED PHRASE-STRUCTURE GRAMMARS Massimo Marino*, Antonella Spiezio, Giacomo Ferrari*, Irina ... Via Della Faggiola 32, 1-56100 Pisa -Italy ABSTRACT In this paper we present an efficient context- free (CF) bottom-up, non deterministic parser. It is an extension of the ICA (Immediate Constituent...

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

... Categorial Grammars are weakly equivalent to Context- Free Grammars (CFG's). Mote recently it has been found that there is a class of languages slightly larger than the class of Context- Free ... the previous or future context of the derivation. Several wen-known formalisms fall into this class including Context- Free Grammars, Gener- alized Phrase Structure Grammars (GPSG), Head Gram- ... V. Aho. Indexed grammars An extension to context free grammars. J. ACM, 15:647 671, 1968. [3] Y. Bar-Hillel, C. Gaifman, and E. Shamir. On cate- gorial and phrase structure grammars. In Language...

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

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

... theoretical results proving that CCGbank contains no non -context- free structure and that the Clark and Curran parser is actually a context- free parser. Based on these results, we trained the Petrov ... that for a wide range of CCGs there is a context- free grammar (CFG) that has exactly the same derivations. Included in this class of strongly context- free CCGs are a grammar including all the ... is a strongly context- free CCG which gener- ates all of the derivations in CCGbank, it is still possible that the grammar learned by the Clark and Curran parser is not a context- free grammar. However,...

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