generalized phrase structure grammars

... approxi- mations for context-free grammars and equivalent augmented phrase- structure grammar formalisms. The approximation is exact for certain context- free grammars generating regular languages, ... Computer Science, Yale University PO Box 2158 Yale Station New Haven, CT 06520 Abstract Phrase- structure grammars are an effective rep- resentation for important syntactic and semantic aspects ... at state 4 would lead to a transition on nonter- 247 FINITE-STATE APPROXIMATION OF PHRASE STRUCTURE GRAMMARS Fernando C. N. Pereira AT&T Bell Laboratories 600 Mountain Ave. Murray...

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

... PROCESSING ENGLISH WITH A GENERALIZED PHRASE STRUCTURE GRAMMAR Jean Mark Gawron, Jonathan King, John Lamping, Egon Loebner, Eo Anne ... Hewlett-Packard's Computer Research Center. The system's main components are: a Generalized Phrase Structure Grammar (GPSG); a top-down parser; a logic transducer that outputs a first-order ... 1981. The research had three goals: (1) demonstrating the computational tractability of Generalized Phrase Structure Grammar (GPSG), (2) implementing a GPSG system covering a large fragment of...

Ngày tải lên: 08/03/2014, 18: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 ... (1976), and its major improvements are described. It has been designed to run Augmented Phrase- Structure Grammars (APSG) and performs semantic interpretation in parallel with syntactic analysis. ... VoI.I: Syntax. Addison-Wesley. 202 AN EFFICIENT CONTEXT-FREE PARSER FOR AUGMENTED PHRASE- STRUCTURE GRAMMARS Massimo Marino*, Antonella Spiezio, Giacomo Ferrari*, Irina Prodanof+ *Linguistics...

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

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

... 2012. c 2012 Association for Computational Linguistics Robust Conversion of CCG Derivations to Phrase Structure Trees Jonathan K. Kummerfeld † Dan Klein † James R. Curran ‡ † Computer Science Division ‡ e -lab, ... james@it.usyd.edu.au Abstract We propose an improved, bottom-up method for converting CCG derivations into PTB-style phrase structure trees. In contrast with past work (Clark and Curran, 2009), which used simple transductions ... inconsistencies. Clark and Curran (2009) developed a CCG to PTB conversion that treats the CCG derivation as a phrase structure tree and applies hand-crafted rules to ev- ery pair of categories that combine in...

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

... that it might be possible to "infer" a phrase s~ruc'~r,e ~ L,-,, jus~ the grouping s~ruc~ure of ~he input (i.e., j us~ phrase boundaries). Pur~her, the set of descrip~iuns ... unbounded T/leory of ~z~nsformations," ki~ic Analysis, Vol. 2, 1976. [2] Gezdar, .G.J.M., " ;Phrase s-~,%~-%n0z~ grammar," to appear zn The Nal-ure of S},nr.actic Representation, (eds....

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

... base noun phrases (NPs), commit- ting only to flat structures that ignore the complexity of English NPs. This means that tools trained on Treebank data cannot learn the correct internal structure ... generates the correct sub-NP structure, then the system may return a non- sensical answer even though the correct dominating noun phrase has been found. Base-NP structure is also important for ... Treebank phrase structure to Combinatory Categorial Gram- mar (CCG) (Steedman, 2000) derivations. Since CCG derivations are binary branching, they cannot di- rectly represent the flat structure...

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

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

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

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

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

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

... focus of previous works, but also understanding their semantic structure. In this work, we formally define the semantic structure of noun phrase queries as comprised of intent heads and intent modifiers. ... (again for Movie). 3 Query Semantic Structure Unlike database query languages such as SQL, web queries are usually formulated as sequences of words without explicit structures. This makes web queries ... automatically makes such decisions, we first need to understand what constitute the se- mantic structure of a noun phrase query. 3.1 Definition We let C denote a set of query intent classes that represent...

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

... syllable structure from iso- lated words, here we investigate whether learning syllable structure together with word segmentation improves word segmentation accuracy. Modeling syllable structure ... Linguistics Using adaptor grammars to identify synergies in the unsupervised acquisition of linguistic structure Mark Johnson Brown University Mark Johnson@Brown.edu Abstract Adaptor grammars (Johnson ... learning these interacting linguistic structures simultaneously. Adaptor grammars are also interesting because they can be viewed as directly inferring linguistic structure. Most well-known machine-learning...

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

... Generalized Multitext Grammars I. Dan Melamed Computer Science Department New York University 715 Broadway, ... struc- tures. Our proposal generalizes MTG by moving from component grammars that generate context- free languages to component grammars whose gen- erative power is equivalent to Linear Context-Free Rewriting ... got laid off)]. While the two sen- tences have the same meaning, the objects of their verb phrases are structured very differently. GMTG can express their relationships as follows: S S NP VP NP...

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

... lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional pars- ing algorithms some of the computation associ- ated with different structures ... A structure- sharing parser for lexicalized grammars Roger Evans Information Technology Research Institute University ... describe a precompilation tech- nique for such grammars which allows some of this computation to be shared. In our approach the elementary structures of the grammar are transformed into finite...

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

... of broad coverage grammars: e.g., once you allow adverbial phrases almost anywhere and al- low PPs, (participial) VPs, and (temporal) NPs to be adverbial phrases, along with phrases headed by ... context-free grammars. In Pro- ceedings of the Sixth International Workshop on Parsing Technologies. Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of ... For list grammars, this number is the sum of the lengths of all rules in the grammar. For trie grammars, it is the number of unique rule prefixes (including the LHS) in the grammar. For minimized grammars, ...

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

... are quite effective in practice. 3 Probabilistic Context-Free Grammars Context-Free Grammars are a simple model of hi- erarchical structure often used to describe natu- ral language syntax. A ... of this paper is structured as follows. The next section reviews Latent Dirichlet Alloca- tion (LDA) topic models, and the following sec- tion reviews Probabilistic Context-Free Grammars (PCFGs). ... spe- cialized left-branching structure, and it is straight- forward to modify the general-purpose CFG infer- ence procedures to avoid the cubic time complex- ity for such grammars: thus it may be...

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

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

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