Thomas Hanneforth

According to our database, Thomas Hanneforth authored at least 17 papers between 1995 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2019

Building Resources for Georgian Treebanking-Based NLP.

Oleg Kapanadze, Gideon Kotzé, Thomas Hanneforth

Proceedings of the Language, Logic, and Computation - 13th International Tbilisi Symposium, 2019

2018

Pushing for weighted tree automata.

Thomas Hanneforth, Andreas Maletti, Daniel Quernheim

Log. Methods Comput. Sci., 2018

2013

Random Generation of Nondeterministic Finite-State Tree Automata.

Thomas Hanneforth, Andreas Maletti, Daniel Quernheim

Proceedings of the Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, 2013

Parsing Morphologically Complex Words.

Kay-Michael Würzner, Thomas Hanneforth

Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing, 2013

2012

An Efficient Parallel Determinisation Algorithm for Finite-state Automata.

Thomas Hanneforth, Bruce W. Watson

Proceedings of the Prague Stringology Conference 2012, 2012

2011

A Practical Algorithm for Intersecting Weighted Context-free Grammars with Finite-State Automata.

Thomas Hanneforth

Proceedings of the Finite-State Methods and Natural Language Processing, 2011

2009

Statistical Language Models within the Algebra of Weighted Rational Languages.

Thomas Hanneforth, Kay-Michael Würzner

Acta Cybern., 2009

<i>fsm2</i> - A Scripting Language for Creating Weighted Finite-State Morphologies.

Thomas Hanneforth

Proceedings of the State of the Art in Computational Morphology, 2009

Using Ranked Semirings for Representing Morphology Automata.

Thomas Hanneforth

Proceedings of the State of the Art in Computational Morphology, 2009

<i>fsm2</i> - A Scripting Language Interpreter for Manipulating Weighted Finite-State Automata.

Thomas Hanneforth

Proceedings of the Finite-State Methods and Natural Language Processing, 2009

2008

A Memory-efficient epsilon-Removal Algorithm for Weighted Acyclic Finite-State Automata.

Thomas Hanneforth

Proceedings of the Finite-State Methods and Natural Language Processing, 2008

2007

A Natural Language Interface for a 2D Networked Game.

Andrea Corradini, Adrian Bak, Thomas Hanneforth

Proceedings of the Human-Computer Interaction. HCI Applications and Services, 2007

A Robust Spoken Language Architecture to Control a 2D Game.

Andrea Corradini, Thomas Hanneforth, Adrian Bak

Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, 2007

2005

Longest-Match Pattern Matching with Weighted Finite State Automata.

Thomas Hanneforth

Proceedings of the Finite-State Methods and Natural Language Processing, 2005

TAGH: A Complete Morphology for German Based on Weighted Finite State Automata.

Alexander Geyken, Thomas Hanneforth

Proceedings of the Finite-State Methods and Natural Language Processing, 2005

2003

Rhetorical Parsing with Underspecification and Forests.

Thomas Hanneforth, Silvan Heintze, Manfred Stede

Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, 2003

1995

Morphologische Analyse und Argumentstrukturberechnung.

Andreas Dörfler, Thomas Hanneforth

Proceedings of the Sprache und Computer: Angewandte Computerlinguistik, 1995