On multiple context-free grammars
Theoretical Computer Science
The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
A Characterization of Minimalist Languages
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Chart parsing and constraint programming
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
The information-processing difficulty of incremental parsing
IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together
Dependency structures derived from minimalist grammars
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Deriving syntactic properties of arguments and adjuncts from neo-Davidsonian semantics
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
A formal foundation for A and A-bar movement
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Without remnant movement, MGs are context-free
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Closure properties of minimalist derivation tree languages
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Well-nestedness properly subsumes strict derivational minimalism
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Strict deterministic aspects of minimalist grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Movement-generalized minimalist grammars
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Reference-Set constraints as linear tree transductions via controlled optimality systems
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Locality and the complexity of minimalist derivation tree languages
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Geometric Representations for Minimalist Grammars
Journal of Logic, Language and Information
| Hi-index | 0.00 |
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 defined (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 identifies some of the important notions of structural similarity, with attention to similarity claims that are prominent in the current linguistic tradition of transformational grammar.