Results 1  10
of
33
Generating Copies: An investigation into structural identity in language and grammar
, 2006
"... ..."
A Recognizer for Minimalist Grammars
 In Proceedings of the Sixth International Workshop on Parsing Technologies (IWPT 2000
, 2000
"... Minimalist Grammars are a rigorous formalization of the sort of grammars proposed in the linguistic framework of Chomsky's Minimalist Program. One notable property of Minimalist Grammars is that they allow constituents to move during the derivation of a sentence, thus creating discontinuous c ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
(Show Context)
Minimalist Grammars are a rigorous formalization of the sort of grammars proposed in the linguistic framework of Chomsky's Minimalist Program. One notable property of Minimalist Grammars is that they allow constituents to move during the derivation of a sentence, thus creating discontinuous constituents.
Observations on Strict Derivational Minimalism
 ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
, 2001
"... Deviating from the denition originally presented in [12], Stabler [13] introduced inspired by some recent proposals in terms of a minimalist approach to transformational syntaxa (revised) type of a minimalist grammar (MG) as well as a certain type of a strict minimalist grammar (SMG). These two type ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
(Show Context)
Deviating from the denition originally presented in [12], Stabler [13] introduced inspired by some recent proposals in terms of a minimalist approach to transformational syntaxa (revised) type of a minimalist grammar (MG) as well as a certain type of a strict minimalist grammar (SMG). These two types can be shown to determine the same class of derivable string languages.
Minimalist Grammars and Recognition
"... Recent work has shown how basic ideas of the minimalist tradition intransformational syntax can be captured in a simple generative formalism, a"der:"AII] al minimalism." Thisfr]]I[L" can model "rel nant movement" analyses, which yield mor e complex antecedenttr ace r e ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
Recent work has shown how basic ideas of the minimalist tradition intransformational syntax can be captured in a simple generative formalism, a"der:"AII] al minimalism." Thisfr]]I[L" can model "rel nant movement" analyses, which yield mor e complex antecedenttr ace r elations, suggesting a new and significant sense in which linguistic str ctur esar "chain based." Michaelis (1998) showed that these grI] mar cor" spond to a certain kind of linear context free r write system, and this paper takes the next step of adapting ther ecognition methods for "nonconcatenative"grOO[]" (Weir 1988; Seki et al., 1991; Boullier , 1999). This tur ns out to be quite straightforward once the grammars are set out appropriately.
Structural similarity within and among languages
 Theoretical Computer Science
"... Linguists rely on intuitive conceptions of structure when comparing expressions and languages. In an algebraic presentation of a language, some natural notions of similarity can be rigorously dened (e.g. among elements of a language, equivalence w.r.t. isomorphisms of the language; and among langua ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
(Show Context)
Linguists rely on intuitive conceptions of structure when comparing expressions and languages. In an algebraic presentation of a language, some natural notions of similarity can be rigorously dened (e.g. among elements of a language, equivalence w.r.t. isomorphisms of the language; and among languages, equivalence w.r.t. isomorphisms of symmetry groups), but it turns out that slightly more complex and nonstandard notions are needed to capture the kinds of comparisons linguists want to make. This paper identies some of the important notions of structural similarity, with attention to similarity claims that are prominent in the current linguistic tradition of transformational grammar.
On the treatment of scrambling and adjunction in minimalist grammars
 In Proceedings, Formal Grammar’02
, 2002
"... Stabler (2001:258) suggested that ""asymmetric " feature checking " is among the mechanisms that "remain to be carefully explored " within his "minimalist grammars " framework. Our presentation will undertake exactly this kind o ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
Stabler (2001:258) suggested that &quot;&quot;asymmetric &quot; feature checking &quot; is among the mechanisms that &quot;remain to be carefully explored &quot; within his &quot;minimalist grammars &quot; framework. Our presentation will undertake exactly this kind of exploration. Concretely, we are going to extend the &quot;minimalist
On Minimalist Attribute Grammars and Macro Tree Transducers
 Linguistic Form and its Computation
"... In this paper we extend the work by Michaelis (1999) which shows how to encode an arbitrary Minimalist Grammar in the sense of Stabler (1997) into a weakly equivalent multiple contextfree grammar (MCFG). By viewing MCFGrules as terms in a free Lawvere theory we can translate a given MCFG into a ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
In this paper we extend the work by Michaelis (1999) which shows how to encode an arbitrary Minimalist Grammar in the sense of Stabler (1997) into a weakly equivalent multiple contextfree grammar (MCFG). By viewing MCFGrules as terms in a free Lawvere theory we can translate a given MCFG into a regular tree grammar. The latter is characterizable by both a tree automaton and a corresponding formula in monadic secondorder (MSO) logic. The trees of the resulting regular tree language are then unpacked into the intended \linguistic" trees both through an MSO transduction based upon treewalking automata and through a macro tree transduction. This twostep approach gives an operational as well as a logical description of the tree sets involved. As an interlude we show that MCFGs can be regarded as a particularly simple attribute grammar. 1 Introduction Algebraic, logical and regular characterizations of (tree) languages provide a natural framework for the denotational and opera...
A Note on Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
, 2005
"... Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they fall into two groups. On the one hand there are interventionbased LCs (ILCs) often formulated as “minimality constra ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they fall into two groups. On the one hand there are interventionbased LCs (ILCs) often formulated as “minimality constraints” (“minimal link condition,” “minimize chain links,”“shortest move,” “attract closest,” etc.). On the other hand there are containmentbased LCs (CLCs) typically defined in terms of (generalized) grammatical functions (“adjunct island,” “subject island,” “specifier island,” etc.). Research on LCs has been dominated by two very general trends. First, attempts have been made at unifying ILCs and CLCs on the basis of notions such as “government ” and “barrier ” (e.g. [4]). Secondly, research has often been guided by the intuition that, beyond empirical coverage, LCs somehow contribute to restricting the formal capacity of grammars (cf. [3, p. 125], [6, p. 14f]). Both these issues, we are going to argue, can be fruitfully studied within the framework of minimalist