Marco Kuhlmann: Publications
2012
- Tree-Adjoining Grammars are not Closed Under Strong Lexicalization. In Computational Linguistics, 2012. Just Accepted publication December 8, 2011.
2011
- A Generalized View on Parsing and Translation. In Proceedings of the Twelfth International Conference on Parsing Technologies (IWPT), pp. 2–13. Dublin, Ireland, 2011.
- Dynamic Programming Algorithms for Transition-Based Dependency Parsers. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics (ACL), pp. 673–682. Portland, OR, USA, 2011.
2010
- Transition-Based Techniques for Non-Projective Dependency Parsing. In Northern European Journal of Language Technology 2(1), pp. 1–19, 2010.
- Dependency Structures Derived from Minimalist Grammars. In Christian Ebert, Gerhard Jäger, and Jens Michaelis, editors, The Mathematics of Language. 10th and 11th Biennial Conference, MOL 10, Los Angeles, CA, USA, July 28–30, 2007, and MOL 11, Bielefeld, Germany, August 20–21, 2009, Revised Selected Papers, volume 6149 of Lecture Notes in Computer Science, pp. 1–12. Springer, 2010.
- Dependency Structures and Lexicalized Grammars: An Algebraic Approach, volume 6270 of Lecture Notes in Computer Science. Springer, 2010.
- The Importance of Rule Restrictions in CCG. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL), pp. 534–543. Uppsala, Sweden, 2010.
- Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems. In Proceedings of Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL), pp. 276–284. Los Angeles, USA, 2010.
2009
- Dependency Grammar: Classification and Exploration. In Matthew W. Crocker and Jörg Siekmann, editors, Resource-Adaptive Cognitive Processes, pp. 365–388. Springer, 2009.
- An Improved Oracle for Dependency Parsing with Online Reordering. In Proceedings of the Eleventh International Conference on Parsing Technologies (IWPT), pp. 73–76. Paris, France, 2009.
- Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems. In Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL), pp. 539–547. Boulder, CO, USA, 2009.
- Dependency Trees and the Strong Generative Capacity of CCG. In Proceedings of the Twelfth Conference of the European Chapter of the Association for Computational Linguistics (EACL), pp. 460–468. Athens, Greece, 2009.
- Treebank Grammar Techniques for Non-Projective Dependency Parsing. In Proceedings of the Twelfth Conference of the European Chapter of the Association for Computational Linguistics (EACL), pp. 478–486. Athens, Greece, 2009.
2008
- Ogden’s Lemma for Regular Tree Languages. CoRR Entry 0810.4249, Uppsala University, Uppsala, Sweden, 2008.
- Logics and Automata for Totally Ordered Trees. In Andrei Voronkov, editor, Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15–17. Proceedings, volume 5117 of Lecture Notes in Computer Science, pp. 217–231. Springer, 2008.
2007
- Dependency Structures and Lexicalized Grammars. PhD thesis, Saarland University, Saarbrücken, Germany, 2007. E. W. Beth Dissertation Prize 2008.
- The String-Generative Capacity of Regular Dependency Languages. In Proceedings of the Twelfth Conference on Formal Grammar (FG). Dublin, Ireland, 2007.
- Mildly Context-Sensitive Dependency Languages. In Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics (ACL), pp. 160–167. Prague, Czech Republic, 2007.
2006
- Mildly Non-Projective Dependency Structures. In Proceedings of the 21st International Conference on Computational Linguistics (COLING) and 44th Annual Meeting of the Association for Computational Linguistics (ACL) Main Conference Poster Sessions, pp. 507–514. Sydney, Australia, 2006.
- Extended Cross-Serial Dependencies in Tree Adjoining Grammars. In Proceedings of the Eighth International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+), pp. 121–126. Sydney, Australia, 2006.
2005
- Lexicalised Configuration Grammars (Extended Version). Technical report, Saarland University, Saarbrücken, Germany, 2005.
- Lexicalised Configuration Grammars. In Proceedings of the Second International Workshop on Constraint Solving and Language Processing (CSLP), pp. 34–49. Sitges, Spain, 2005.
- Expressivity and Complexity of Dependency Grammars. In Proceedings of the Internal Conference of the Swedish Graduate School of Language Technology. Gothenburg, Sweden, 2005.
- Well-Nested Drawings as Models of Syntactic Structure (Extended Version). Technical report, Saarland University, Saarbrücken, Germany, 2005.
- Well-Nested Drawings as Models of Syntactic Structure. In Proceedings of the Tenth Conference on Formal Grammar (FG) and Ninth Meeting on Mathematics of Language (MOL), pp. 195–203. Edinburgh, UK, 2005.
- Multi-Dimensional Graph Configuration for Natural Language Processing. In Henning Christiansen, Peter Rossen Skadhauge, and Jørg Villadsen, editors, 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. 104–120. Springer, 2005.
2004
- A Relational Syntax-Semantics Interface Based on Dependency Grammar. In Proceedings of the 20th International Conference on Computational Linguistics (COLING), pp. 176–182. Geneva, Switzerland, 2004.
- TAG Parsing as Model Enumeration. In Proceedings of the Seventh International Workshop on Tree Adjoining Grammar and Related Formalisms (TAG+), pp. 148–154. Vancouver, Canada, 2004.
2003
- A Tiny Constraint Modelling Language. Bachelor’s thesis, Saarland University, Saarbrücken, Germany, 2003.
- Statistical A-Star Dependency Parsing. In Proceedings of the Workshop on Prospects and Advances in the Syntax/Semantics Interface, pp. 85–89. Nancy, France, 2003.
2002
- Towards a Constraint Parser for Categorial Type Logics. Master’s thesis, University of Edinburgh, Edinburgh, UK, 2002.