Skip to main content

Type Signature Induction with FCAType

  • Conference paper
Concept Lattices and Their Applications (CLA 2006)

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

Included in the following conference series:

  • 547 Accesses

Abstract

Type signatures are common in modern linguistic theories. Their construction and maintenance is intricate, and therefore, an automatic induction method is desirable. In the present paper we present FCAType, a module of our system FCALing, that automatically induces type signatures from sets of untyped feature structures. The induction procedure is based on so-called decomposition semilattices which serve as a basis for initial type signatures. These signatures can be folded up to result in compact and restrictive type signatures which adequately specify the input structures.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sag, I., Wasow, T.A.: Syntactic Theory: A Formal Introduction. In: CSLI, Stanford (1999)

    Google Scholar 

  2. Minsky, M.: A framework for representing knowledge. In: Winston, P.H. (ed.) The Psychology of Computer Vision, pp. 211–277. McGraw-Hill, New York (1975)

    Google Scholar 

  3. Petersen, W.: Induktion von Typsignaturen mit Mitteln der Formalen Begriffsanalyse. PhD thesis, University of Düsseldorf (in submission process)

    Google Scholar 

  4. Shieber, S.M.: An Introduction to Unification-Based Approaches to Grammar. In: CSLI, Stanford (1986)

    Google Scholar 

  5. Carpenter, B.: The Logic of Typed Feature Structures. In: Cambridge Tracts in Theoretical Computer Science 32. CUP (1992)

    Google Scholar 

  6. Penn, G.: The Algebraic Structure of Attributed Type Signatures. PhD thesis, School of Computer Science, Carnegie Mellon University (2000)

    Google Scholar 

  7. Arnold, D.J., Badia, T., van Genabith, J., Markantonatou, S., Momma, S., Sadler, L., Schmidt, P.: Experiments in reusability of grammatical resources. In: Proceedings of 6th EACL, pp. 12–20 (1993)

    Google Scholar 

  8. Kilbury, J., Petersen, W., Rumpf, C.: Inheritance-based models of the lexicon. In: Wunderlich, D. (ed.) Advances in the Theory of the Lexicon, pp. 429–477. Mouton de Gruyter, Berlin (2006)

    Google Scholar 

  9. Petersen, W., Kilbury, J.: What feature co-occurrence restrictions have to do with type signatures. In: Proceedings of FG/MOL-2005, Edinburgh, pp. 125–139 (2005)

    Google Scholar 

  10. Wintner, S., Sarkar, A.: A note on typing feature structures. Computational Linguistics 28(3), 389–397 (2002)

    Article  Google Scholar 

  11. Sporleder, C.: Discovering Lexical Generalisations. A Supervised Machine Learning Approach to Inheritance Hierarchy Construction. PhD thesis, School of Informatics, University of Edinburgh (2003)

    Google Scholar 

  12. Ganter, B., Kuznetsov, S.O.: Pattern Structures and Their Projections. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, Springer, Heidelberg (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Sadok Ben Yahia Engelbert Mephu Nguifo Radim Belohlavek

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petersen, W. (2008). Type Signature Induction with FCAType . In: Yahia, S.B., Nguifo, E.M., Belohlavek, R. (eds) Concept Lattices and Their Applications. CLA 2006. Lecture Notes in Computer Science(), vol 4923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78921-5_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78921-5_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78920-8

  • Online ISBN: 978-3-540-78921-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics