We propose a parser based on ideas from the Minimalist Programme. The parser supports free word order languages and simulates a human listener who necessarily begins sentence analysis before all the words in the sentence have become available. We first sketch the problems that free word order languages pose. Next we discuss an existing framework for minimalist parsing, and show how it is difficult to make it work for free word order languages and simulate realistic syntactic conditions. We briefly describe a formalism and a parsing algorithm that elegantly overcome these difficulties, and we illustrate them with detailed examples from Latin, a language whose word order freedom causes it to exhibit seemingly difficult discontinuous noun phrase situations.
CITATION STYLE
Sayeed, A. B., & Szpakowicz, S. (2004). Developing a minimalist parser for free word order languages with discontinuous constituency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3230, pp. 115–126). Springer Verlag. https://doi.org/10.1007/978-3-540-30228-5_11
Mendeley helps you to discover research relevant for your work.