Skip to main content

The automatic deduction of classificatory systems from linguistic theories (abridged)

  • Selected Papers
  • Conference paper
  • First Online:
Logical Aspects of Computational Linguistics (LACL 1996)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1328))

Abstract

Classifying linguistic objects is a widespread and important linguistic task, and computational linguistics often requires the deduction of a classificatory system from a general linguistic theory. Since hand deducing a classificatory system may consume much effort and introduce errors, a device that effectively deduces accurate classificatory systems from general linguistic theories would benefit computational linguistics. We present a prototypical abstract device that automatically deduces classificatory systems from finite linguistic theories.

This paper is an abridged version of [7]. The authors wish to thank the Seminar für Sprachwissenschaft, Tübingen, for hosting the writing of this paper, and the Internationales Zentrum, Tübingen, for funding Simov's visit to the Seminar. This paper is due in equal parts to both authors.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bob Carpenter. The Logic of Typed Feature Structures. Cambridge Tracts in The oretical Computer Science, number 32. Cambridge University Press, Cambridge, England. 1992.

    Google Scholar 

  2. Thilo Götz. “A normal form algorithm for King's descriptive formalism.” Term paper. Seminar für Sprachwissenschaft, Eberhard-Karls-Universität, Tübingen, Germany. 1993.

    Google Scholar 

  3. Peter Graf. Term Indexing. Lecture Notes in Artificial Intelligence 1053. Springer-Verlag, Berlin, Germany. 1995.

    Google Scholar 

  4. Stephan Kepser. “A satisfiability algorithm for a typed feature logic.” SFB 340 technical report 60. IBM Deutschland GmbH, Heidelberg, Germany. 1994.

    Google Scholar 

  5. Paul J. King. A Logical Formalism for Head-Driven Phrase Structure Grammar. Doctoral thesis. The University of Manchester, Manchester, England. 1989.

    Google Scholar 

  6. Paul J. King. “An expanded logical formalism for head-driven phrase structure grammar.” SFB 340 technical report 59. IBM Deutschland GmbH, Heidelberg, Germany. 1994.

    Google Scholar 

  7. Paul J. King and Kiril Iv. Simov. “The automatic deduction of classificatory sys-tems from linguistic theories.” Unpublished manuscript. 1997.

    Google Scholar 

  8. Carl J. Pollard and Ivan A. Sag. Information-Based Syntax and Semantics, vol. 1. CSLI Lecture Notes 13. CSLI, Stanford, California, USA. 1987.

    Google Scholar 

  9. Carl J. Pollard and Ivan A. Sag. Head-Driven Phrase Structure Grammar. University of Chicago Press, Chicago, Illinois, USA. 1994.

    Google Scholar 

  10. Kiril Simov and Paul J. King. “Indexing of linguistic knowledge.” In Proc. Logical Aspects of Computational Linguistics (lecture abstracts), pages 81–84. Nancy, France. 1996.

    Google Scholar 

  11. Kiril Simov, Galia Angelova and Elena Paskaleva. “MORPHO-ASSISTANT: The proper treatment of morphological knowledge.” In Proc. COLING'90, vol. 3, pages 453–457. Helsinki, Finland. 1990.

    Google Scholar 

  12. Kiril Simov, Elena Paskaleva, Mariana Damova and Milena Slavcheva. “MORPHO-ASSISTANT: A knowledge-based system for Bulgarian morphology.” In Proc. Third Conference on Applied Natural Language Processing (systems demonstrations), pages 17–18. Trento, Italy. 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Christian Retoré

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

King, P.J., Simov, K.I. (1997). The automatic deduction of classificatory systems from linguistic theories (abridged). 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/BFb0052161

Download citation

  • DOI: https://doi.org/10.1007/BFb0052161

  • 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

Publish with us

Policies and ethics