Abstract
If one converts surface filters into context free rules, one has to introduce new features. These features are strictly nonlexical, and their distribution is predictable from the distribution of the lexical features. Now, given a (feature based) context free grammar, we ask whether one can identify the nonlexical features. This is not possible; however, the notion of an inessential feature offers an approximation. To arrive at a descriptive theory of language one needs to eliminate all the inessential features. One can measure the complexity of a language by the complexity of the formulae needed to define the distribution of inessential features.
This research has been carried out in collaboration with the Innovationskolleg ‘Formale Modelle kognitiver Komplexität’ (INK 12/A3) at Potsdam University, funded by the DFG. I wish to thank Jens Michaelis for many useful discussions. Thanks also to Hans Leiß and James Rogers for raising interesting questions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Patrick Blackburn, Wilfried Meyer-Viol, and Maarten de Rijke. A Proof System for Finite Trees. In H. Kleine Büning, editor, Computer Science Logic '95, number 1092 in Lecture Notes in Computer Science, pages 86–105. Springer, 1996.
Noam Chomsky. Bare Phrase Structure. In Gert Webelhuth, editor, Government and Binding Theory and the Minimalist Program, pages 385–439. Blackwell, 1995.
Valentin Goranko and Solomon Passy. Using the universal modality: Gains and Questions. Journal of Logic and Computation, 2:5–30, 1992.
Marcus Kracht. Is there a genuine modal perspective on feature structures? Linguistics and Philosophy, 18:401–458, 1995.
Marcus Kracht. Syntactic Codes and Grammar Refinement. Journal of Logic, Language and Information, 1995.
Marcus Kracht. Tools and Techniques in Modal Logic. Habilitationsschrift, Department of Mathematics, FU Berlin, 1996.
Marcus Kracht. On Reducing Principles to Rules. In Maarten de Rijke and Patrick Blackburn, editors, Specifying Syntactic Structure, pages 95–122, CSLI, 1996.
James Rogers. Studies in the Logic of Trees with Applications to Grammar Formalisms. PhD thesis, Department of Computer and Information Sciences, University of Delaware, 1994.
James Rogers. Strict LT2: regular — Local: recognizable. this volume, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kracht, M. (1997). Inessential features. In: Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 1996. Lecture Notes in Computer Science, vol 1328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052150
Download citation
DOI: https://doi.org/10.1007/BFb0052150
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63700-4
Online ISBN: 978-3-540-69631-5
eBook Packages: Springer Book Archive