The Tuebingen HPSG Archive

[Bolc et al., 1996]

Leonard Bolc and Krzysztof Czuba and Anna Kupść and Małgorzata Marciniak and Agnieszka Mykowiecka and Adam Przepiórkowski (1996).
A Survey of Systems for Implementing HPSG Grammars.
Technical Report Nr. 814. Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland, Warsaw, Poland.

[Carpenter and Penn, 1996]

Bob Carpenter and Gerald Penn (1996).
Efficient Parsing of Compiled Typed Attribute Value Logic Grammars.
In: Harry Bunt and Masaru Tomita (eds.), Recent Advances in Parsing Technology. pp. 145--168. Kluwer Academic Publishers, Dordrecht, Boston, London.

[Carpenter and Penn, 1999]

Bob Carpenter and Gerald Penn (1999).
ALE 3.2 User's Guide.
Technical Memo Nr. CMU-LTI-99-MEMO. Carnegie Mellon Language Technologies Institute.

[Carpenter et al., 1997]

Bob Carpenter and Gerald Penn and Octav Popescu (1997).
The Attribute Logic Engine (ALE) 3.0, User's Guide (distributed with Prolog software, HPSG grammar, and Syllabification Grammar).
Technical Report. Language Technologies Institute, Carnegie Mellon University.

[Fouvry, 2000]

Frederik Fouvry (2000).
Robust unification for linguistics.
In: Afzal Ballim and Vincenzo Pallotta and Hatem Ghorbel (eds.), ROMAND 2000: Workshop on RObust Methods in Analysis of Natural language Data. Lausanne, Switzerland. Media Research Group, Laboratoire d'Informatique Théorique, Département d'Informatique, Ecole Polytechnique Fédérale de Lausanne.

[Fouvry and Meurers, 2000]

Frederik Fouvry and Detmar Meurers (2000).
Towards a platform for linearization grammars.
In: Erhard Hinrichs and Detmar Meurers and Shuly Wintner (eds.), Proceedings of the ESSLLI-2000 Workshop on Linguistic Theory and Grammar Implementation. Birmingham, UK, pp. 153--168.

[Gerdemann, 1994]

Dale Gerdemann (1994).
Parsing as Tree Traversal.
In: Proceedings of the 15th Conference on Computational Linguistics (COLING-94). Kyoto, Japan, pp. 396--400.

[Gerdemann, 1995]

Dale Gerdemann (1995).
Open and Closed World Types in NLP Systems.
In: Proceedings of 5. Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft. Düsseldorf, Germany, pp. 25--30.

[Gerdemann and Hinrichs, 1995]

Dale Gerdemann and Erhard Hinrichs (1995).
Some open problems in head-driven generation.
In: Jennifer Cole and Georgia M. Green and Jerry L. Morgan (eds.), Linguistics And Computation. Volume 52 of CSLI Lecture Notes. pp. 165--197. CSLI Publications, Stanford, CA.

[Gerdemann and King, 1993]

Dale Gerdemann and Paul John King (1993).
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. pp. 33--39.

[Gerdemann and King, 1994]

Dale Gerdemann and Paul John King (1994).
The Correct and Efficient Implementation of Appropriateness Specifications for Typed Feature Structures.
In: Proceedings of the 15th Conference on Computational Linguistics (COLING-94). Kyoto, Japan, pp. 956--960.

[Gerdemann and van Noord, 1999]

Dale Gerdemann and Gertjan van Noord (1999).
Transducers from Rewrite Rules with Backreferences.
In: Proceedings of the 9th Conference of the European Chapter of the Association for Computational Linguistics (EACL 99). Bergen, Norway, pp. 126--133.

[Goetz and Penn, 1997]

Thilo Goetz and Gerald Penn (1997).
A Proposed Linear Specification Language.
Volume 134. Arbeitspapiere des SFB 340. Universität Tübingen.

[Götz, 1995]

Thilo Götz (1995).
Compiling HPSG constraint grammars into logic programs.
In: Proceedings of the joint ELSNET/COMPULOG- NET/EAGLES workshop on Computational logic for natural language processing. Edinburgh, Scotland.

[Götz, 2000]

Thilo Götz (2000).
Feature Constraint Grammars.
Phil. Dissertation, Eberhard-Karls-Universität Tübingen.

[Götz and Meurers, 1995]

Thilo Götz and Walt Detmar Meurers (1995).
Compiling HPSG type constraints into definite clause programs.
In: Proceedings of the Thirty-Third Annual Meeting of the ACL. Boston, pp. 85--91. Association for Computational Linguistics.

[Götz and Meurers, 1996]

Thilo Götz and Walt Detmar Meurers (1996).
``The importance of being lazy'' -- Using lazy evaluation to process queries to HPSG grammars --.
In: Philippe Blache (ed.), Actes de la Troisième conférence annuelle sur le Traitement Automatique du Language Naturel (TALN'96) et de la Troisième Conférence Internationale sur HPSG (HPSG'96). Marseille, France, pp. 24--33.

[Götz and Meurers, 1997]

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

[Götz and Meurers, 1999]

Thilo Götz and Walt Detmar Meurers (1999).
``The Importance of Being Lazy'' -- Using Lazy Evaluation to Process Queries to HPSG Grammars.
In: Gert Webelhuth and Jean-Pierre Koenig and Andreas Kathol (eds.), Lexical and Constructional Aspects of Linguistic Explanation. pp. 249--264. CSLI Publications, Stanford.

[Götz et al., 1997]

Thilo Götz and Detmar Meurers and Dale Gerdemann (1997).
The ConTroll Manual. (ConTroll v.1.0 beta, XTroll v.5.0 beta).
User's Manual. Seminar für Sprachwissenschaft, Universität Tübingen.

[Griffith et al., 1995]

John Griffith and Erhard Hinrichs and Tsuneko Nakazawa (1995).
Topics in Constraint-Based Grammar Formalism for Computational Linguistics.
SfS Report Nr. 4-95. Seminar für Sprachwissenschaft, Eberhard-Karls-Universität Tübingen.

[Hinrichs et al., 2000]

Erhard Hinrichs and Detmar Meurers and Shuly Wintner (eds.) (2000).
Proceedings of the ESSLLI-2000 Workshop on Linguistic Theory and Grammar Implementation.
Birmingham, UK.

[Kepser, 1994]

Stephan Kepser (1994).
A Satisfiability Algorithm for a Logic for Typed Feature Structures.
Arbeitspapiere des SFB 340 Nr. 60. Universität Tübingen, Germany.

[Meurers, 1994]

Walt Detmar Meurers (1994).
On Implementing an HPSG Theory -- Aspects of the Logical Architecture, the Formalization, and the Implementation of Head-Driven Phrase Structure Grammars.
In: Erhard W. Hinrichs and Walt Detmar Meurers and Tsuneko Nakazawa (eds.), Partial-VP and Split-NP Topicalization in German -- An HPSG Analysis and its Implementation. Arbeitspapiere des SFB 340 Nr. 58, pp. 47--155. Universität Tübingen, Tübingen, Germany.

[Meurers, 1995]

Walt Detmar Meurers (1995).
Towards a Semantics for Lexical Rules as used in HPSG.
In: Proceedings of the ACQUILEX II Workshop on the Formalisation and Use of Lexical Rules. Cambridge, UK, pp. 1--20. Also presented at the First Conference on Formal Grammar, Barcelona, 1995.

[Meurers and Minnen, 1995]

Walt Detmar Meurers and Guido Minnen (1995).
A Computational Treatment of HPSG Lexical Rules as Covariation in Lexical Entries.
In: Proceedings of the Fifth International Workshop on Natural Language Understanding and Logic Programming. Lissabon, Portugal. A revised version of this article was published in Computational Linguistics, 23(4), pp. 543-568 (1997); see [Meurers and Minnen, 1997].

[Meurers and Minnen, 1996]

Walt Detmar Meurers and Guido Minnen (1996).
Off-line Constraint Propagation for Efficient HPSG Processing.
In: Philippe Blache (ed.), Actes de la Troisième conférence annuelle sur le Traitement Automatique du Language Naturel (TALN'96) et de la Troisième Conférence Internationale sur HPSG (HPSG'96). Marseille, France, pp. 4--13.

[Meurers and Minnen, 1997]

Walt Detmar Meurers and Guido Minnen (1997).
A Computational Treatment of Lexical Rules in HPSG as Covariation in Lexical Entries.
In: Computational Linguistics, 23(4):543--568.

[Meurers and Minnen, 1999]

Walt Detmar Meurers and Guido Minnen (1999).
Off-Line Constraint Propagation for Efficient HPSG Processing.
In: Gert Webelhuth and Andreas Kathol and Jean-Pierre Koenig (eds.), Lexical and Constructional Aspects of Linguistic Explanation. pp. 299--314. CSLI Publications, Stanford, CA. For an earlier electronic version of this paper see: [Meurers and Minnen, 1996].

[Meurers et al., 2002]

W. Detmar Meurers and Gerald Penn and Frank Richter (2002).
A Web-based Instructional Platform for Constraint-Based Grammar Formalisms and Parsing.
In: Dragomir Radev and Chris Brew (eds.), Effective Tools and Methodologies for Teaching NLP and CL. New Brunswick, NJ, pp. 18--25. Published by The Association for Computational Linguistics. Proceedings of the Workshop held at the 40th Annual Meeting of the Association for Computational Linguistics. 7.--12. July 2002. Philadelphia, PA.

[Minnen, 1992]

Guido Minnen (1992).
Earley-type Parsing of TAG and Factoring Linear Precedence.
In: Proceedings of the Second Tree Adjoining Grammar+ Workshop. Philadelphia, Pennsylvania.

[Minnen, 1994]

Guido Minnen (1994).
Predictive Left-to-Right Parsing of a Restricted Variant of TAG(LD/LP).
Arbeitspapiere des SFB 340 Nr. 45. Universität Tübingen, Germany.

[Minnen, 1994]

Guido Minnen (1994).
Predictive Left-to-Right Parsing of a Restricted Variant of TAG(LD/LP).
In: Computational Intelligence, 10(4):535--548.

[Minnen, 1996]

Guido Minnen (1996).
Magic for Filter Optimization in Dynamic Bottom-up Processing.
In: Aravind Joshi and Martha Palmer (eds.), Proceedings of the 34th Annual Meeting of the Association of Computational Linguistics. Santa Cruz, CA, USA, pp. 247--254. Published by Morgan Kaufmann Publishers.

[Minnen, 1998]

Guido Minnen (1998).
Off-line Compilation for Efficient Processing with Constraint-logic Grammars.
Phil. Dissertation, Eberhard-Karls-Universität Tübingen, Germany. Published as: Arbeitspapiere des SFB 340, Nr. 130. For a more recent publication based on the doctoral thesis of Guido Minnen see: [Minnen, 2001].

[Minnen, 1999]

Guido Minnen (1999).
Selective Magic HPSG Parsing.
In: Proceedings of the 9th Conference of the European Chapter of the Association of Computational Linguistics. Bergen, Norway, pp. 165--172.

[Minnen, 2001]

Guido Minnen (2001).
Efficient Processing with Constraint-Logic Grammars using Grammar Compilation.
Stanford Monographs in Linguistics. CSLI Publications, Stanford, CA.

[Minnen and Gerdemann, 1993]

Guido Minnen and Dale Gerdemann (1993).
Direct Automated Inversion of Logic Grammars.
Arbeitspapiere des SFB 340 Nr. 35. Universität Tübingen, Germany.

[Minnen et al., 1993]

Guido Minnen and Dale Gerdemann and Erhard Hinrichs (1993).
Direct Automated Inversion of Logic Grammars.
In: Proceedings of the Fourth International Workshop on Natural Language Understanding and Logic Programming. Nara, Japan, pp. 17--37.

[Minnen et al., 1996]

Guido Minnen and Dale Gerdemann and Erhard W. Hinrichs (1996).
Direct Automated Inversion of Logic Grammars.
In: New Generation Computing, 14(2):131--168. For an earlier electronic version of this paper see: [Minnen et.al, 1993].

[Minnen et al., 1995]

Guido Minnen and Dale Gerdemann and Thilo Götz (1995).
Off-line Optimization for Earley-style HPSG Processing.
In: Proceedings of the 7th Conference of the European Chapter of the Association for Computational Linguistics. Dublin, Ireland, pp. 173--179.

[Morawietz, 1995]

Frank Morawietz (1995).
Formalization and Parsing of Typed Unification-Based ID/LP Grammars.
Arbeitspapiere des SFB 340 Nr. 68. Universität Tübingen.

[Morawietz, 1995]

Frank Morawietz (1995).
A Unification-Based ID/LP Parsing Schema.
In: Fourth International Workshop on Parsing Technologies (IWPT'95). Prague and Karlovy Vary, Czech Republic, pp. 162--173. Published by Institute of Formal and Applied Linguistics, Charles University, Prague.

[van Noord and Gerdemann, 1999]

Gertjan van Noord and Dale Gerdemann (1999).
An Extendible Regular Expression Compiler for Finite-state Approaches in Natural Language Processing.
In: Proceedings of WIA 99: Workshop on Implementing Automata, XIV-1-XIV-15.

[Ovchinnikova and Richter, 2006]

Ekaterina Ovchinnikova and Frank Richter (2006).
Graphical Software for Teaching and Visualizing RSRL and Description Logics.
In: Proceedings of the Second International Congress on Tools for Teaching Logic (SICTTL). Salamanca, Spain, pp. 143--147.

[Ovchinnikova and Richter, 2007]

Ekaterina Ovchinnikova and Frank Richter (2007).
Morph Moulder: Teaching Software for HPSG and Description Logics.
In: Journal of the Interest Group in Pure and Applied Logic, 15(4):333--345.

[Penn, 1996]

Gerald Penn (1996).
On the Connection between Context-Free Grammars and Lambek Categorial Grammars.
Technical Report Nr. CMU-LCL-96-2. Carnegie Mellon University, Laboratory for Computational Linguistics.

[Penn, 1998]

Gerald Penn (1998).
On the Connection between Context-Free Grammars and Lambek Categorial Grammars.
Technical Report Nr. CMU-CS-98-180. Carnegie Mellon University Department of Computer Science.

[Penn, 1999]

Gerald Penn (1999).
Tractability and Structural Closures in Attribute Logic Type Signatures.
Arbeitspapiere des SFB 340 Nr. 135. Universität Tübingen, Germany. This paper has been superseded by [Penn, 2001].

[Penn, 1999]

Gerald Penn (1999).
A Parsing Algorithm to Reduce Copying in Prolog.
Arbeitspapiere des SFB 340 Nr. 137. Universität Tübingen, Germany.

[Penn, 1999]

Gerald Penn (1999).
An Optimised Prolog Encoding of Typed Feature Structures.
Arbeitspapiere des SFB 340 Nr. 138. Universität Tübingen, Germany.

[Penn, 1999]

Gerald Penn (1999).
Optimising Don't-Care Non-Determinism with Statistical Information.
Arbeitspapiere des SFB 340 Nr. 140. Universität Tübingen, Germany.

[Penn, 1999]

Gerald Penn (1999).
A Quasi-Ring Construction for Compiling Attributed Type Signatures.
Arbeitspapiere des SFB 340 Nr. 141. Universität Tübingen, Germany.

[Penn, 1999]

Gerald Penn (1999).
An Optimized Prolog Encoding of Typed Feature Structures.
In: D. DeSchreye (ed.), Logic Programming: Proceedings of the 1999 International Conference on Logic Programming. Cambridge, MA, pp. 124--138. Published by MIT Press.

[Penn, 1999]

Gerald Penn (1999).
A Quasi-Ring Construction for Compiling Attributed Typed Signatures.
In: J. Rogers (ed.), Proceedings of the 6th Meeting of the Mathematics of Language. pp. 105--114. Published by University of Florida.

[Penn, 2000]

Gerald Penn (2000).
The Algebraic Structure of Attributed Type Signatures.
Ph.D. thesis, School of Computer Science, Carnegie Mellon University.

[Penn, 2000]

Gerald Penn (2000).
Applying Constraint Handling Rules to HPSG.
In: Frank Morawietz (ed.), Arbeitspapiere des SFB 340. Volume 150. pp. 51--68. Universität Tübingen. This paper has been superseded by the paper presented at the First International Conference on Computational Logic (CL2000), Workshop on Rule-Based Constraint Reasoning and Programming, Imperial College, UK, August 2000; see: [Penn, 2000].

[Penn, 2000]

Gerald Penn (2000).
Applying Constraint Handling Rules to HPSG.
In: Proceedings of the First International Conference on Compuational Logic (CL2000), Workshop on Rule-based Constraint Reasoning and Programming. London, UK.

[Penn, 2000]

Gerald Penn (2000).
The Algebraic Structure of Transitive Closure and its Application to Attributed Type Signatures.
In: Grammars, 3(2-3):295--312.

[Penn, 2001]

Gerald Penn (2001).
Tractability and Structural Closures in Attribute Logic Type Signatures.
In: Proceedings of the of the 39th Annual Meeting of the ACL and the 10th Conference of the EACL. pp. 410--417. Association for Computational Linguistics.

[Penn and Carpenter, 1999]

Gerald Penn and Bob Carpenter (1999).
ALE for Speech: A Translation Prototype.
In: Proceedings of the 6th Conference on Speech Communication and Technology (EUROSPEECH). Volume 2. Budapest, Hungary, pp. 947--950.

[Penn and Popescu, 1997]

Gerald Penn and Octav Popescu (1997).
Head-Driven Generation and Indexing in ALE.
In: Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics, Workshop on Computational Environments for Grammar Development and Linguistic Engineering (ENVGRAM). Madrid, Spain, pp. 62--69.

[Penn and Richter, 2004]

Gerald Penn and Frank Richter (2004).
Lexical Resource Semantics: From Theory to Implementation.
In: Stefan Müller (ed.), Proceedings of the 11th International Conference on Head-Driven Phrase Structure Grammar. pp. 423--443. Published by CSLI Publications.

[Penn and Richter, 2005]

Gerald Penn and Frank Richter (2005).
The Other Syntax: Approaching Natural Language Semantics Through Logical Form Composition.
In: Henning Christiansen and Peter Rossen Skadhauge and Jørgen Villadsen (eds.), Constraint Solving and Language Processing. First International Workshop, CSLP 2004, Roskilde, Denmark, September 1-3, 2004, Revised Selected and Invited Papers. Volume 3438 of Lecture Notes in Computer Science. pp. 48--73. Published by Springer.

[Penn and Steinicke, 1999]

Gerald Penn and Karen Steinicke (1999).
Compiling Feature-based Constraints with Complex Antecedents.
Arbeitspapiere des SFB 340 Nr. 136. Universität Tübingen, Germany.

[Richter and Kallmeyer, 2007]

Frank Richter and Laura Kallmeyer (2007).
Feature logic-based semantic composition: A comparison between LRS and LTAG.
In: Anders Søgaard and Petter Haugereid (eds.), Postproceedings of The 1st International Workshop on Typed Feature Structure Grammars. Volume 7 of CST Working Papers, København, Denmark. pp. 31--83.

[Sailer and Richter, 2001]

Manfred Sailer and Frank Richter (2001).
Eine XML-Kodierung für AVM-Beschreibungen.
In: Henning Lobin (ed.), Proceedings der GLDV-Frühjahrstagung 2001. pp. 161--168. Published by Gesellschaft für linguistische Datenverarbeitung.

[Suhre, 2000]

Oliver Suhre (2000).
Computational Aspects of a Grammar Formalism for Languages with Freer Word Order.
Diplomarbeit, Eberhard-Karls-Universität Tübingen. Publiziert als Arbeitspapier des SFB 340, Nr. 154.

[Zahnert, 1997]

Andreas Zahnert (1997).
fl2c -- ein Compiler für CLP(TFS).
Diplomarbeit, Fakultät für Informatik, Universität Tübingen.