Abstract
Classifying linguistic objects is a widespread and important linguistic task, but hand deducing a classificatory system from a general linguistic theory can consume much effort and introduce pernicious errors. We present an abstract prototype device that effectively deduces an accurate classificatory system from a finite linguistic theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aldag, B., A proof theoretic investigation of prediction in HPSG. Master's Thesis, Seminar für Sprachwissenschaft, Eberhard-Karls-Universität, Tübingen, Germany, 1997.
Götz, T., A normal form for typed feature structures. Sonderforschungsbereich 340 Technical report 40, IBM Deutschland GmbH, Heidelberg, Germany, 1994.
Graf, P., TermIndexing, No. 1053. In Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin, Germany, 1995.
Kepser, S., A satisfiability algorithm for a typed feature logic. Sonderforschungsbereich 340 Technical Report 60, IBM Deutschland GmbH, Heidelberg, Germany, 1994.
King, P. J., A logical formalism for head-driven phrase structure grammar. Ph. D. thesis, Manchester University, Manchester, England, 1989.
King, P. J., An expanded logical formalism for head-driven phrase structure grammar. Sonderforschungsbereich 340 Technical Report 59, IBM Deutschland GmbH, Heidelberg, Germany, 1994.
King, P. J. and K. Iv. Simov, The automatic deduction of classificatory systems from linguistic theories (abridged), In C. Retore, editor, The Proceedings of Logical Aspects of Computational Linguistics 1996, No. 1328 in Lecture Notes in Artificial Intelligence, 248–273, Springer-Verlag, Berlin, Germany, 1997.
King, P. J., K. Iv. Simov, and B. Aldag, The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar. The Journal of Logic, Language and Information, 1998.
Meurers, D. and G. Minnen, A computational treatment of lexical rules in HPSG as covariation in lexical entries. Computational Linguistics 23(4), 1997.
Pollard, C. J., Strong generative capacity in HPSG. In G. Webelhuth, J.-P. Koenig, and A. Kathol, editors, Lexical and Constructional Aspects of Linguistic Explanation, CSLI, Stanford, California, USA, 1998.
Pollard, C. J. and I. A. Sag, Information-Based Syntax and Semantics, No. 13 in CSLI Lecture Notes. CSLI, Stanford, California, USA, 1987.
Pollard, C. J. and I. A. Sag, Head-driven Phrase Structure Grammar. University of Chicago Press. Chicago, Illinois, USA, 1994.
Richter, F., A relational extension of speciate reentrant logic. Ph. D. thesis, Seminar für Sprachwissenschaft, Eberhard-Karls-Universität, Tübingen, Germany, in preparation.
Richter, F. and M. Sailer, Remarks on linearisation: Reflection on the treatment of LP-rules in HPSG in a typed feature logic. Master's Thesis, Seminar für Sprachwissenschaft, Eberhard-Karls-Universität, Tübingen, Germany, 1995.
Simov, K., G. Angelova, and E. Paskaleva, ‘MORPHO-ASSISTANT: The proper treatment of morphological knowledge’. In The Proceedings of COLING'90, Vol. 3. 453–457. Helsinki, Finland, 1990.
Simov, K. Iv. and P. J. King, Indexing of linguistic knowledge'. In Logical Aspects of Computational Linguistics (Conference Handout) 81–84. Villers-lès-Nancy, France, 1996.
Simov, K., E. Paskaleva, M. Damova, and M. Slavcheva, MORPHO-ASSISTANT: A knowledge-based system for Bulgarian morphology. In The Proceedings of the Third Conference on Applied Natural Language Processing (Systems Demonstrations), 17–18. Trento, Italy, 1992.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
King, P.J., Simov, K.I. The Automatic Deduction of Classificatory Systems from Linguistic Theories. Grammars 1, 103–153 (1998). https://doi.org/10.1023/A:1009909418521
Issue Date:
DOI: https://doi.org/10.1023/A:1009909418521