| |
| 2008 | ||
|---|---|---|
| 7 | EE | Thomas Hanneforth: A Memory-efficient epsilon-Removal Algorithm for Weighted Acyclic Finite-State Automata. FSMNLP 2008: 72-81 |
| 2007 | ||
| 6 | Andrea Corradini, Thomas Hanneforth, Adrian Bak: A Robust Spoken Language Architecture to Control a 2D Game. FLAIRS Conference 2007: 199-204 | |
| 5 | EE | Andrea Corradini, Adrian Bak, Thomas Hanneforth: A Natural Language Interface for a 2D Networked Game. HCI (4) 2007: 225-234 |
| 2005 | ||
| 4 | EE | Alexander Geyken, Thomas Hanneforth: TAGH: A Complete Morphology for German Based on Weighted Finite State Automata. FSMNLP 2005: 55-66 |
| 3 | EE | Thomas Hanneforth: Longest-Match Pattern Matching with Weighted Finite State Automata. FSMNLP 2005: 78-85 |
| 2003 | ||
| 2 | EE | Thomas Hanneforth, Silvan Heintze, Manfred Stede: Rhetorical Parsing with Underspecification and Forests. HLT-NAACL 2003 |
| 1995 | ||
| 1 | Andreas Dörfler, Thomas Hanneforth: Morphologische Analyse und Argumentstrukturberechnung. GLDV-Jahrestagung 1995: 279-290 | |
| 1 | Adrian Bak | [5] [6] |
| 2 | Andrea Corradini | [5] [6] |
| 3 | Andreas Dörfler | [1] |
| 4 | Alexander Geyken | [4] |
| 5 | Silvan Heintze | [2] |
| 6 | Manfred Stede | [2] |