Filters








7,224 Hits in 6.3 sec

Multiple Context-Free Tree Grammars: Lexicalization and Characterization [article]

Joost Engelfriet, Andreas Maletti, Sebastian Maneth
2017 arXiv   pre-print
Multiple context-free tree grammars have the same string generating power as multiple context-free (string) grammars and polynomial time parsing algorithms.  ...  Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting".  ...  Multiple context-free tree grammars In this section we introduce the main formalism discussed in this contribution: the multiple context-free tree grammars.  ... 
arXiv:1707.03457v1 fatcat:mhkis4o4gnhjtc6kuajwsratme

Multiple context-free tree grammars: Lexicalization and characterization

Joost Engelfriet, Andreas Maletti, Sebastian Maneth
2018 Theoretical Computer Science  
Multiple context-free tree grammars have the same string generating power as multiple context-free (string) grammars and polynomial time parsing algorithms.  ...  Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting".  ...  Multiple context-free tree grammars In this section we introduce the main formalism discussed in this contribution: the multiple context-free tree grammars.  ... 
doi:10.1016/j.tcs.2018.03.014 fatcat:5brpoklfvregzlu3ewqxow4tjy

Tree-Adjoining Grammars [chapter]

Aravind K. Joshi, Yves Schabes
1997 Handbook of Formal Languages  
to one of the major issues: can context-free grammars be lexicalized?  ...  We will also describe the notion of lexicalization of grammars Section 3. and investigate the relationship of lexicalization to context-free grammars CFGs and TAGs and then summarize the issues on lexicalization  ... 
doi:10.1007/978-3-642-59126-6_2 fatcat:g7ovnsvc5rdvxd43hybs4u7n5a

Mildly Non-Projective Dependency Grammar

Marco Kuhlmann
2013 Computational Linguistics  
In this article we present a formalism for non-projective dependency grammar in the framework of linear context-free rewriting systems.  ...  A characteristic property of our formalism is a close correspondence between the non-projectivity of the dependency trees admitted by a grammar on the one hand, and the parsing complexity of the grammar  ...  Acknowledgments The author gratefully acknowledges financial support from The German Research Foundation (Sonderforschungsbereich 378, project MI 2) and The Swedish Research Council (diary no. 2008-296  ... 
doi:10.1162/coli_a_00125 fatcat:n2kfm62mwncijiczdhvvo4dlyy

Lexicalization and Grammar Development [article]

B. Srinivas, Dania Egedi, Christy Doran, Tilman Becker (University of Pennsylvania)
1994 arXiv   pre-print
We also present a method for compact and efficient representation of lexicalized trees.  ...  We illustrate the advantages of lexicalized grammars in various contexts of natural language processing, ranging from wide-coverage grammar development to parsing and machine translation.  ...  Tree Adjoining Languages (TALs) fall into the class of mildly context-sensitive languages, and as such are strictly more powerful than context-free languages.  ... 
arXiv:cmp-lg/9410015v1 fatcat:km7qk7upcfgkfag7j4s5tj3hie

Interaction Grammars [article]

Bruno Guillaume, Guy Perrier (INRIA Lorraine - LORIA)
2008 arXiv   pre-print
It is expressed in a model-theoretic framework where grammars are constraint systems using the notion of tree description and parsing appears as a process of building tree description models satisfying  ...  criteria of saturation and minimality.  ...  The paper is restricted to the syntactic level of natural languages but syntax cannot be modelled without any idea of the semantic level and of the interface between the two levels; [35] presents a first  ... 
arXiv:0809.0494v1 fatcat:6d2k7rzpxbd4dlsmi74m63c2ua

Less Grammar, More Features

David Hall, Greg Durrett, Dan Klein
2014 Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)  
parse accurately with context-free backbones as minimal as Xbar grammars.  ...  Moving context out of the grammar and onto surface features can greatly simplify the structural component of the parser: because so many deep syntactic cues have surface reflexes, our system can still  ...  Acknowledgments This work was partially supported by BBN under DARPA contract HR0011-12-C-0014, by a Google PhD fellowship to the first author, and an NSF fellowship to the second.  ... 
doi:10.3115/v1/p14-1022 dblp:conf/acl/HallDK14 fatcat:ykz7cwwnizfxlnz4e6ffysyazi

D-Tree Substitution Grammars

Owen Rambow, K. Vijay-Shanker, David Weir
2001 Computational Linguistics  
There is considerable interest among computational linguists in lexicalized grammatical frameworks; lexicalized tree adjoining grammar (LTAG) is one widely studied example.  ...  Changing the way the lexicalized formalism is viewed raises questions as to the desirability of certain aspects of the formalism. We present a new formalism, d-tree substitution grammar (DSG).  ...  Properties of the Languages of DSG It is clear that any context-free language can be generated by DSG (a context-free grammar can simply be reinterpreted as a DSG).  ... 
doi:10.1162/089120101300346813 fatcat:3hexwlwb6zhuzn3bzmpdsw5oky

Grammars as Representations for Music

C. Roads, Paul Wieneke
1979 Computer Music Journal  
Acknowledgements Thanks to Curtis Abbott for his critical reading and comments during the preparation of this paper. Bibliography  ...  The six major forms to be discussed here include: free, context-sensitive, context-free, finite-state, transformational, and regulated grammars.  ...  Both the grammar specification language (TREE) and the composing language (COTREE) make use of context-free rewriting rules which can be augmented by control procedures.  ... 
doi:10.2307/3679756 fatcat:quu3kmvxwnffdbijmsvr4f3cjm

Distributions on Minimalist Grammar Derivations

Tim Hunter, Chris Dyer
2013 Mathematics of Language  
We present three ways of inducing probability distributions on derivation trees produced by Minimalist Grammars, and give their maximum likelihood estimators.  ...  We argue that a parameterization based on locally normalized log-linear models balances competing requirements for modeling expressiveness and computational tractability.  ...  Acknowledgments Thanks to John Hale for helpful discussion and to the anonymous reviewers for their insightful comments. This work was sponsored by NSF award number 0741666, and by the U. S.  ... 
dblp:conf/mol/HunterD13 fatcat:yoy2albwdveqjkkxek6a5a5txm

Complexity in left-associative grammar

Roland Hausser
1992 Theoretical Computer Science  
extensions of context-free phrase structure grammars, based on the use of certain additional formal devices (e.g., the tree adjoining grammars and the index grammars).  ...  The resulting classification of languages is orthogonal to the context-free languages and their extensions, e.g., the tree-adjoining languages and the index languages.  ... 
doi:10.1016/0304-3975(92)90253-c fatcat:stywnpghwrbsjlwr7o2pi4rjti

Combinatory Categorial Grammar [chapter]

Mark Steedman
2011 Taking Scope  
This restriction limits expressivity to the level of context-free grammar, and CCG generalizes the context-free core by introducing further rules for combining categories.  ...  In particular, Ades and Steedman (1982:522) suggested that the same stack might be implicated both in the push-down automaton (PDA) characteristic of context-free grammar and in mediating multiple unbounded  ... 
doi:10.7551/mitpress/9780262017077.003.0006 fatcat:2uteapar2jd7tiku77rylcdkla

Combinatory Categorial Grammar [chapter]

Mark Steedman, Jason Baldridge
2011 Non-Transformational Syntax  
This restriction limits expressivity to the level of context-free grammar, and CCG generalizes the context-free core by introducing further rules for combining categories.  ...  In particular, Ades and Steedman (1982:522) suggested that the same stack might be implicated both in the push-down automaton (PDA) characteristic of context-free grammar and in mediating multiple unbounded  ... 
doi:10.1002/9781444395037.ch5 fatcat:nfovjbngrrfwxjfiqjlkiv5g6u

Combinatory Categorial Grammar [chapter]

M. Steedman, J. Baldridge
2006 Encyclopedia of Language & Linguistics  
This restriction limits expressivity to the level of context-free grammar, and CCG generalizes the context-free core by introducing further rules for combining categories.  ...  In particular, Ades and Steedman (1982:522) suggested that the same stack might be implicated both in the push-down automaton (PDA) characteristic of context-free grammar and in mediating multiple unbounded  ... 
doi:10.1016/b0-08-044854-2/02028-9 fatcat:ks4myyz6zna25jm2l433h2xqgi

Statistical Parsing with Context-Free Filtering Grammar [chapter]

Michael Demko, Gerald Penn
2009 Lecture Notes in Computer Science  
Statistical Parsing with Context-Free Filtering Grammar Statistical parsers that simultaneously generate both phrase-structure and lexical dependency trees have been limited in two important ways: the  ...  I develop context-free filtering grammar as a generalization of the more restrictive lexicalized factored parsing model, and I develop for the new grammar formalism a scoring model to resolve parsing ambiguities  ...  Context-Free Filtering Grammar Informally, a context-free filtering grammar defines a set of syntactic structures, each of which consists of a dependency tree and a phrase structure tree.  ... 
doi:10.1007/978-3-642-01818-3_8 fatcat:yqk3escl4vc4fawypxhjfkhrbm
« Previous Showing results 1 — 15 out of 7,224 results