 | 2011 |
|---|
| 12 |       | Thomas Hanneforth:
A Practical Algorithm for Intersecting Weighted Context-free Grammars with Finite-State Automata.
FSMNLP 2011: 57-64 |
| 2009 |
|---|
| 11 | | Thomas Hanneforth:
fsm2 - A Scripting Language Interpreter for Manipulating Weighted Finite-State Automata.
FSMNLP 2009: 13-30 |
| 10 | | Thomas Hanneforth:
Using Ranked Semirings for Representing Morphology Automata.
SFCM 2009: 1-9 |
| 9 | | Thomas Hanneforth:
fsm2 - A Scripting Language for Creating Weighted Finite-State Morphologies.
SFCM 2009: 48-63 |
| 8 | | Thomas Hanneforth,
Kay-Michael Würzner:
Statistical Language Models within the Algebra of Weighted Rational Languages.
Acta Cybern. 19(2): 313-356 (2009) |
| 2008 |
|---|
| 7 | | 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 | | Andrea Corradini,
Adrian Bak,
Thomas Hanneforth:
A Natural Language Interface for a 2D Networked Game.
HCI (4) 2007: 225-234 |
| 2005 |
|---|
| 4 | | Alexander Geyken,
Thomas Hanneforth:
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata.
FSMNLP 2005: 55-66 |
| 3 | | Thomas Hanneforth:
Longest-Match Pattern Matching with Weighted Finite State Automata.
FSMNLP 2005: 78-85 |
| 2003 |
|---|
| 2 | | 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page