default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Hanneforth
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c15]Oleg Kapanadze, Gideon Kotzé
, Thomas Hanneforth:
Building Resources for Georgian Treebanking-Based NLP. TbiLLC 2019: 60-78- 2018
- [j2]Thomas Hanneforth, Andreas Maletti, Daniel Quernheim:
Pushing for weighted tree automata. Log. Methods Comput. Sci. 14(1) (2018) - 2017
- [i1]Thomas Hanneforth, Andreas Maletti, Daniel Quernheim:
Pushing for weighted tree automata. CoRR abs/1702.00304 (2017) - 2015
- [e1]Thomas Hanneforth, Christian Wurm:
Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing, FSMNLP 2015, Düsseldorf, Germany, June 22-24, 2015. The Association for Computer Linguistics 2015 [contents] - 2013
- [c14]Kay-Michael Würzner, Thomas Hanneforth:
Parsing Morphologically Complex Words. FSMNLP 2013: 39-43 - [c13]Thomas Hanneforth, Andreas Maletti, Daniel Quernheim:
Random Generation of Nondeterministic Finite-State Tree Automata. TTATT 2013: 11-16 - 2012
- [c12]Thomas Hanneforth, Bruce W. Watson:
An Efficient Parallel Determinisation Algorithm for Finite-state Automata. Stringology 2012: 42-52 - 2011
- [c11]Thomas Hanneforth:
A Practical Algorithm for Intersecting Weighted Context-free Grammars with Finite-State Automata. FSMNLP 2011: 57-64
2000 – 2009
- 2009
- [j1]Thomas Hanneforth, Kay-Michael Würzner:
Statistical Language Models within the Algebra of Weighted Rational Languages. Acta Cybern. 19(2): 313-356 (2009) - [c10]Thomas Hanneforth:
fsm2 - A Scripting Language Interpreter for Manipulating Weighted Finite-State Automata. FSMNLP 2009: 13-30 - [c9]Thomas Hanneforth:
Using Ranked Semirings for Representing Morphology Automata. SFCM 2009: 1-9 - [c8]Thomas Hanneforth:
fsm2 - A Scripting Language for Creating Weighted Finite-State Morphologies. SFCM 2009: 48-63 - 2008
- [c7]Thomas Hanneforth:
A Memory-efficient epsilon-Removal Algorithm for Weighted Acyclic Finite-State Automata. FSMNLP 2008: 72-81 - 2007
- [c6]Andrea Corradini, Thomas Hanneforth, Adrian Bak:
A Robust Spoken Language Architecture to Control a 2D Game. FLAIRS 2007: 199-204 - [c5]Andrea Corradini, Adrian Bak, Thomas Hanneforth:
A Natural Language Interface for a 2D Networked Game. HCI (4) 2007: 225-234 - 2005
- [c4]Alexander Geyken, Thomas Hanneforth:
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata. FSMNLP 2005: 55-66 - [c3]Thomas Hanneforth:
Longest-Match Pattern Matching with Weighted Finite State Automata. FSMNLP 2005: 78-85 - 2003
- [c2]Thomas Hanneforth, Silvan Heintze, Manfred Stede:
Rhetorical Parsing with Underspecification and Forests. HLT-NAACL 2003
1990 – 1999
- 1995
- [c1]Andreas Dörfler, Thomas Hanneforth:
Morphologische Analyse und Argumentstrukturberechnung. GLDV-Jahrestagung 1995: 279-290
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
