#### DMCA

## A Recognizer for Minimalist Grammars (2000)

Venue: | In Proceedings of the Sixth International Workshop on Parsing Technologies (IWPT 2000 |

Citations: | 18 - 1 self |

### Citations

2827 |
The Minimalist Program.
- Chomsky
- 1995
(Show Context)
Citation Context ... involve movement of constituents. Stabler ([8]) presents a formalism for dening minimalist grammars that allow for movement of constituents. This formalism is based on Chomsky's Minimalist Program ([=-=2-=-]). Michaelis ([5]) provides an argument showing that minimalist grammars as dened in ([8]) are weakly equivalent to multiple context-free grammars as described in Seki et al. ([6]). 1 Multiple contex... |

190 | Principles and implementation of deductive parsing.
- SHIEBER, SCHABES, et al.
- 1995
(Show Context)
Citation Context ...f the Recognizer This section contains a formal denition of an agenda-driven, chart-based recognizer for minimalist languages. Taking a logical perspective on parsing as presented in Shieber et al. ([7]), the denition of the recognizer includes a specication of a grammatical deductive system and a specication of a deduction procedure. The formulae of the deductive system, which are commonly calle... |

158 |
Characterizing Mildly Context-Sensitive Grammar Formalisms.
- Weir
- 1988
(Show Context)
Citation Context ...his introduction, this paper has six sections. Section 1 Hence, minimalist grammars are also weakly equivalent to linear context-free rewriting systems ([11]), multicomponent tree-adjoining grammars (=-=[12-=-]), and simple positive range concatenation grammar ([1]), as these formalisms are equivalent to multiple context-free grammars. 2 introduces the minimalist grammars as dened in [8]. Section 3 contain... |

125 |
On multiple context-free grammars.
- Seki, Matsumara, et al.
- 1991
(Show Context)
Citation Context ...Minimalist Program ([2]). Michaelis ([5]) provides an argument showing that minimalist grammars as dened in ([8]) are weakly equivalent to multiple context-free grammars as described in Seki et al. ([=-=6]-=-). 1 Multiple context-free grammars are non-concatenative in the sense that a non-terminal symbol in this grammar can dominate a sequence of strings of terminal symbols, rather than just one string, a... |

111 |
Verbal Complexes.
- Koopman, Szabolsci
- 2000
(Show Context)
Citation Context ...e. This example shows that remnant movement is easily modeled in minimalist grammars (see Stabler ([9]) for further discussion). Recently, remnant movement has gained some linguistic popularity, e.g. =-=[4-=-], [3]. 5 Note that successful applications of Move-1 and Move-2 as dened in section 3.2.2 do not involve any items from the chart. Shieber et al. ([7]) prove that the deductive procedure is sound { i... |

57 | Derivational minimalism is mildly context-sensitive.
- Michaelis
- 2001
(Show Context)
Citation Context ... of constituents. Stabler ([8]) presents a formalism for dening minimalist grammars that allow for movement of constituents. This formalism is based on Chomsky's Minimalist Program ([2]). Michaelis ([=-=5-=-]) provides an argument showing that minimalist grammars as dened in ([8]) are weakly equivalent to multiple context-free grammars as described in Seki et al. ([6]). 1 Multiple context-free grammars a... |

36 |
Proposal for a natural language processing syntactic backbone
- Boullier
- 1998
(Show Context)
Citation Context ... Hence, minimalist grammars are also weakly equivalent to linear context-free rewriting systems ([11]), multicomponent tree-adjoining grammars ([12]), and simple positive range concatenation grammar (=-=[-=-1]), as these formalisms are equivalent to multiple context-free grammars. 2 introduces the minimalist grammars as dened in [8]. Section 3 contains the specication of the recognizer. Sections 4 and 5 ... |

33 | Remnant movement and complexity
- Stabler
- 1999
(Show Context)
Citation Context ...it creates a conguration in which the moved constituent with yield `2' no longer c-commands its trace. This example shows that remnant movement is easily modeled in minimalist grammars (see Stabler ([=-=9-=-]) for further discussion). Recently, remnant movement has gained some linguistic popularity, e.g. [4], [3]. 5 Note that successful applications of Move-1 and Move-2 as dened in section 3.2.2 do not i... |

14 |
Derivational Minimalism,” in Logical aspects of computational linguistics,
- Stabler
- 1998
(Show Context)
Citation Context ...ther part of the structure of the sentence. Linguistic theories in the transformational tradition have tried to capture this fact by proposing analyses that involve movement of constituents. Stabler (=-=[8-=-]) presents a formalism for dening minimalist grammars that allow for movement of constituents. This formalism is based on Chomsky's Minimalist Program ([2]). Michaelis ([5]) provides an argument show... |

2 |
Characterizing Descriptions Produced by Various Grammatical Formalisms
- Vijay-Shanker, Weir, et al.
- 1987
(Show Context)
Citation Context ...al in the length of the input string. Besides this introduction, this paper has six sections. Section 1 Hence, minimalist grammars are also weakly equivalent to linear context-free rewriting systems (=-=[11]-=-), multicomponent tree-adjoining grammars ([12]), and simple positive range concatenation grammar ([1]), as these formalisms are equivalent to multiple context-free grammars. 2 introduces the minimali... |

1 |
A note on Prepositions and Complementizers. In: A Celebration
- Kayne
- 1999
(Show Context)
Citation Context ...is example shows that remnant movement is easily modeled in minimalist grammars (see Stabler ([9]) for further discussion). Recently, remnant movement has gained some linguistic popularity, e.g. [4], =-=[3-=-]. 5 Note that successful applications of Move-1 and Move-2 as dened in section 3.2.2 do not involve any items from the chart. Shieber et al. ([7]) prove that the deductive procedure is sound { it gen... |

1 |
Performance models for a Derivational Minimalism
- Stabler
(Show Context)
Citation Context ...t. Thus, in a minimalist grammar a constituent can dominate nonadjacent substrings of a sentence. Seki et al. ([6]) also describe an algorithm for recognizing multiple context-free grammars. Stabler (=-=[10-=-]) sketches how this algorithm may be extended to minimalist grammars. This paper contains a formal specication of a recognizer for minimalist grammars. Furthermore, it is shown that the recognizer is... |