Thomas Hanneforth
University of Potsdam
24 Papers
130 Citations
Thomas Hanneforth is an academic researcher from University of Potsdam. The author has contributed to research in topics: Parsing & Finite-state machine. The author has an hindex of 7, co-authored 24 publications.
Chat about Author
Papers
dlexDB : eine lexikalische Datenbank für die psychologische und linguistische Forschung
Julian Heister,Kay-Michael Würzner,Johannes Bubenzer,Edmund Pohl,Thomas Hanneforth,Alexander Geyken,Reinhold Kliegl +6 more
TL;DR: In this paper, a lexikalischen Datenbank dlexDB stelle wir der psychologischen und linguistischen Forschung im World Wide Web online statistische Kennwerte fur eine Vielzahl von verarbeitungsrelevanten Merkmalen von Wortern zur Verfugung.
267
•Journal Article
TAGH : A complete morphology for german based on weighted finite state automata
TL;DR: TAGH as mentioned in this paper is a system for automatic recognition of German word forms based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation.
53
dlexDB - A lexical database for the psychological and linguistic research
Julian Heister,Kay-Michael Würzner,Johannes Bubenzer,Edmund Pohl,Thomas Hanneforth,Alexander Geyken,Reinhold Kliegl +6 more
- 01 Jan 2011
TL;DR: The validity of frequency-based norms of numerous process-related word properties for psychological and linguistic research are illustrated with new results about fixation durations in sentence reading.
19
Rhetorical parsing with underspecification and forests
Thomas Hanneforth,Silvan Heintze,Manfred Stede +2 more
- 27 May 2003
TL;DR: A surface based approach to discourse parsing with an explicit rhetorical grammar is combined in order to efficiently construct an underspecified representation of possible discourse structures.
•Journal Article
Finite State Methods in Morphological Analysis of Runyakitara Verbs
TL;DR: This paper presents a computational model for grammatical Runyakitara verbs, RUNYAGRAM, based on freely-available open-sourced finite-state methods and, in particular, the fsm2 interpreter, that captures the morphotactic structures with non-recursive context -free grammars supported by fsm1 and morpho-phonological alternations with a finite composition of commonly used context-dependent string rewriting rules.
9