Skip to main content

SFB 340: “Linguistic Foundations for Computational Linguistics”

  • Conference paper
Informatik ’98

Part of the book series: Informatik aktuell ((INFORMAT))

  • 113 Accesses

Abstract

The SFB starts from two assumptions: on the one hand a theoretically well-founded linguistic analysis is a necessary prerequisite for the development of computational linguistics and its applications. On the other hand problems and results of natural language processing provide new insights and challenges for theoretical linguistics.

Participating Institutions: University of Stuttgart and University of Tübingen

Participating Subject: Computational Linguistics, Computer Science, Logic, Theoretical Linguistics

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Glenn Carroll and Mats Rooth. Valence induction with a Head-lexicalized PCFG. In Third Conference on Empirical Methods in Natural Language Processing, 1998.

    Google Scholar 

  2. Noam Chomsky. The Minimalist Program. MIT Press, Cambridge, Mass., 1995.

    MATH  Google Scholar 

  3. Jochen Dörre. Efficient construction of underspecified semantics under massive ambiguity. In Proceedings of the Association for Computational Linguistics, 1997.

    Google Scholar 

  4. Jochen Dörre and Michael Dorna. CUF - a formalism for linguistic knowledge representation. Deliverable E.1.2A, DYANA 2, August 1993.

    Google Scholar 

  5. Dale Gerdemann and Paul John King. Typed feature structures for expressing and computationally implementing feature cooccurence restrictions. In Proceedings of 4■ Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft, pages 33–39, 1993.

    Google Scholar 

  6. Dale Gerdemann and Paul John King. The correct and efficient implementation of appropriateness specifications for typed feature structures. In Proceedings of COLING-94, Kyoto, Japan, 1994.

    Google Scholar 

  7. Thilo Götz and Walt Detmar Meurers. Compiling HPSG type constraints into definite clause programs. In Proceedings of the Thrirty-Third Annual Meeting of the ACL, Boston, 1995. Association for Computational Linguistics.

    Google Scholar 

  8. Thilo Götz and Walt Detmar Meurers. The importance of being lazy - using lazy evaluation to process queries to HPSG grammars. In Philipe Blache, editor, Actes de la troisième conférence anuelle sur le traitment automatique du langage naturel, 1996.

    Google Scholar 

  9. Thilo Götz and Walt Detmar Meurers. The ConTroll system as large grammar development platform. In Proceedings of the ACL/EACL post-conference workshop on Computational Environments for Grammar Development and Linguistic Engineering, Madrid, Spain, 1997.

    Google Scholar 

  10. Thilo Götz and Walt Detmar Meurers. Interleaving universal principles and relational constraints over typed feature logic. In Proceedings of the 35th Annual Meeting of the ACL and the 8th Conference of the EACL, Madrid, Spain, 1997.

    Google Scholar 

  11. Thilo Götz, Walt Detmar Meurers, and Dale Gerdemann. The ConTroll Manual (ConTroll v.l.O.ß, Xtroll v.ö.O.ß). Universität Tübingen, Seminar für Sprachwissenschaft, Tübingen, 1997.

    Google Scholar 

  12. Erhard Hinrichs, Detmar Meurers, Frank Richter, Manfred Sailer, and Heike Win- haxt. Ein HPSG-Fragment des Deutschen, Teil 1: Theorie. Arbeitspapiere des SFB 340 Nr. 95, Universität Tübingen, 1997.

    Google Scholar 

  13. IMS Stuttgart. CUF home page, http: //www. ims.uni-Stuttgart. de/cuf/.

    Google Scholar 

  14. Hans Kamp. A theory of truth and semantic representation. In Jeroen Groenendijk, T. Janssen, and Martin Stokhof, editors, Formal Methods in the Study of Language, pages 277–321. Mathematical Centre, Amsterdam, 1981. Reprinted in: Groenendijk, J., Janssen, T. and Stokhof, M. (eds): Truth, Interpretation and Information, pp. 1–41. Dordrecht, Foris, 1984.

    Google Scholar 

  15. Ron Kaplan and Paula Newman. Lexical resource reconciliation in the Xerox Linguistic Environment. In D. Estiva!, A. Lavelli, K. Netter, and F. Pianesi, editors, Computational Environments for Grammar Development amd Linguistic Engineering, ACL Workshop, pages 54–61, Madrid, Spain, 1997.

    Google Scholar 

  16. Paul John King. A logical formalism for Head-driven Phrase Structure Grammar. PhD thesis, University of Manchester, 1989.

    Google Scholar 

  17. Paul John King. An expanded logical formalism for Head-driven Phrase Structure Grammar. Arbeitspapiere des SFB 340 Nr. 59, Universität Tübingen, 1994.

    Google Scholar 

  18. Esther König. A CUF tutorial. Technical report, Institut für Maschinelle Sprachverarbeitung, Universität Stuttgart, 1997. See [13].

    Google Scholar 

  19. Esther König and Uwe Reyle. A general reasoning scheme for underspecified representations. In Hans-Jürgen Ohlbach and Uwe Reyle, editors, Logic and its Applications. Festschrift for Dov Gabbay. Part I. Kluwer, 1997.

    Google Scholar 

  20. Peter Krause, Hans Kamp, and Christian (eds) Rohrer. Ein UDRS-basiertes Semantikfragment für das Deutsche. Dokumentation der Implementierung. Arbeitspapier des Sonderforschungsbereich 340, Institut für Maschinelle Sprachverarbeitung, Universität Stuttgart, October 1997.

    Google Scholar 

  21. Jonas Kuhn. Towards data-intensive testing of a broad-coverage LFG grammar. In Proceedings of KONVENS 1998, Bonn, Germany, October 1998.

    Google Scholar 

  22. Jonas Kuhn, Judith Eckle-Kohler, and Christian Rohr er. Lexicon acquisition with and for symbolic NLP-systems - a bootstrapping approach. In Proceedings of the First International Conference on Language Resources and Evaluation (LREC98), Granada, Spain, 1998.

    Google Scholar 

  23. Jonas Kuhn and Christian Rohrer. Approaching ambiguity in real-life sentences - the application of an Optimality Theory-inspired constraint ranking in a large-scale LFG grammar. In Proceedings of DGfS-CL 1997, Heidelberg, Germany, 1997.

    Google Scholar 

  24. W. Detmar Meurers and Guido Minnen. A computational treatment of lexical rules in HPSG as covariation in lexical entries. Computational Linguistics, 23(4):543– 568, 1997.

    Google Scholar 

  25. Walt Detmar Meurers and Guido Minnen. Off-line constraint propagation for efficient HPSG processing. In Gert Webelhuth, Jean-Pierre Koenig, and Andreas Kathol, editors, Lexical and Constructional Aspects of Linguistic Explanation. CSLI, Stanford, 1998.

    Google Scholar 

  26. Uwe Reyle. Dealing with ambiguities by underspecification: Construction, representation, and deduction. Journal of Semantics, 10 (2): 123–179, 1993.

    Article  Google Scholar 

  27. Michael Schiehlen. Disambiguation of Underspecified Discourse Representation Structures under anaphoric constraints. In International Workshop on Computational Semantics, Tilburg, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rohrer, C. (1998). SFB 340: “Linguistic Foundations for Computational Linguistics”. In: Dassow, J., Kruse, R. (eds) Informatik ’98. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72283-7_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-72283-7_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64938-0

  • Online ISBN: 978-3-642-72283-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics