Algorithmic
|
Algorithmic |
[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 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, 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. |
| [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, 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. |
| [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]. |
| [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. |
| [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 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. |
| [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. |