Interests

Formal languages, parsing, finite-state automata.

Publications

Heister, J., Würzner, K.-M., Bubenzer, J., Pohl, E., Hanneforth, T., Geyken, A. und Kliegl, R (2011): dlexDB - eine lexikalische Datenbank für die psychologische und linguistische Forschung. Psychologische Rundschau, 62(1):10-20, 2011. [PDF]

Hanneforth, Thomas (2010): fsm2 - A Scripting Language Interpreter for Manipulating Weighted Finite-State Automata. In: Yli-Jyrä, A.; Kornai, A.; Sakarovitch, J.; Watson, B. (Eds.): Finite-State Methods and Natural Language Processing. 8th International Workshop, FSMNLP 2009, Pretoria, South Africa, July 21-24, 2009, Revised Selected Papers. Springer. Berlin.
Thomas Hanneforth and Colin de la Higuera (2010). Epsilon-Removal by Loop Reduction for Finite-State Automata over Complete Semirings. In: Thomas Hanneforth and Gisbert Fanselow (2010): Language and Logos. Studia grammatica 72, pages 297-312. Akademie-Verlag, Berlin, 2010.
Thomas Hanneforth und Gisbert Fanselow (Hrsg.): Language and Logos. Studies in Theoretical and Computational Linguistics. Studia Grammatica Nr. 72. Akademie Verlag. 2010.
Katushemererwe, F. and Hanneforth, T. (2010). Finite State Methods in Morphological Analysis of Runyakitara Verbs. Nordic Journal of African Studies, Volume 19 Number 1, 2010, pp. 1-22. [PDF]

Thomas Hanneforth (2009): Using Ranked Semirings for Representing Morphology Automata. In: C. Mahlow & M. Piotrowski (ed.): State of the Art in Computational Morphology. Berlin. Springer. pp. 1-9.
Thomas Hanneforth (2010): fsm2: A Scripting Language for Creating Weighted Finite-state Morphologies. In: C. Mahlow & M. Piotrowski (ed.): State of the Art in Computational Morphology. Berlin. Springer. pp. 48-63.

Thomas Hanneforth and Kay-Michael Würzner (2008): Statistical Language Models within the Algebra of Weighted Rational Languages. Acta Cybernetica 19,2 pp. 313-356
Thomas Hanneforth (2008). A Memory-efficient Epsilon-Removal Algorithm for Weighted Acyclic Finite-State Automata. In Proceedings of FSMNLP 2008. pp.72-81.

Thomas Hanneforth and Kay-Michael Würzner (2007) (eds): Finite State Methods and Natural Language Processing. 6th Internation Workshop, FSMNLP 2007, Potsdam, September 14-16, 2007, Revised Papers. [PDF]
Jörg Didakowski, Thomas Hanneforth and Alexander Geyken (2007): Eigennamenerkennung zwischen morphologischer Analyse und Part-of-Speech Tagging: ein automatentheoriebasierter Ansatz. Zeitschrift für Sprachwissenschaft. Band 26, Heft 2, Seiten 157–186.
Andrea Corradini, Thomas Hanneforth, Adrian Bak (2007): A Robust Spoken Language Architecture to Control a 2D Game. In: Proceedings of FLAIRS Conference 2007. pp.199-204

Thomas Hanneforth (2006): Longest-Match Pattern Matching with Weighted Finite State Automata. In: Finite State Methods and Natural Language Processing. Lecture Notes in Artificial Intelligence, vol. 4002, Springer (5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers).
Alexander Geyken; Hanneforth, Thomas (2006): TAGH: A Complete Morphology for German based on Weighted Finite State Automata. In: Finite State Methods and Natural Language Processing. Lecture Notes in Artificial Intelligence, vol. 4002, Springer (5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers).
Jörg Didakowski, Thomas Hanneforth and Alexander Geyken (2006): Eigennamenerkennung mit großen lexikalischen Ressourcen. Proceedings of KONVENS 2006. [PDF]

FSM<2> and fsm2: A C++ toolkit and a Scripting Language for Creating and Manipulating Weighted Finite-Automata. [download]

2010: University of Zürich: Formale Semantik in Prolog.
2010: Computational Linguistics Summer School, Zadar, Croatia. Introduction to Weighted Finite-State Automata.
2008: University of Zürich: Weighted Automata: Theory and Applications.

Thomas Hanneforth (1999): Aspekte der morphologischen Analyse des Deutschen. Dissertation, Universität Potsdam. [download (in German)]