default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Hahn 0001
Person information
- affiliation: Saarland University, Department of Language Science and Technology, Saarbrücken, Germany
- affiliation (former, PhD 2022): Stanford University, Linguistics Department, CA, USA
- affiliation (former): University of Edinburgh, School of Informatics, UK
- affiliation (former): University of Tübingen, Germany
Other persons with the same name
- Michael Hahn 0002
![[0000-0003-1942-3698]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-1942-3698")
— Mercedes-Benz AG, Stuttgart, Germany (and 1 more) - Michael Hahn 0003 — Stuttgart University of Applied Sciences, Faculty Geomatics, Computer Science und Mathematics, Germany
- Michael Hahn 0004 — Netz Niederösterreich GmbH, Maria Enzersdorf, Austria
- Michael Hahn 0005 — University of Erlangen-Nuremberg, Chair of Systematic Theology (Ethics), Erlangen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Siyu Tao, Lucia Donatelli, Michael Hahn:
More frequent verbs are associated with more diverse valency frames: Efficient principles at the lexicon-grammar interface. ACL (1) 2024: 11795-11810- [c14]Michael Hahn, Mark Rofin:
Why are Sensitive Functions Hard for Transformers? ACL (1) 2024: 14973-15008 - [e1]Michael Hahn, Alexey Sorokin, Ritesh Kumar, Andreas Scherbakov, Yulia Otmakhova, Jinrui Yang, Oleg Serikov, Priya Rani, Edoardo M. Ponti, Saliha Muradoglu, Rena Gao, Ryan Cotterell, Ekaterina Vylomova:
Proceedings of the 6th Workshop on Research in Computational Linguistic Typology and Multilingual NLP, SIGTYPE 2024, St. Julian's, Malta, March 22, 2024. Association for Computational Linguistics 2024, ISBN 979-8-89176-071-4 [contents] - [i17]Michael Hahn, Mark Rofin:
Why are Sensitive Functions Hard for Transformers? CoRR abs/2402.09963 (2024) - [i16]Richard Futrell, Michael Hahn:
Linguistic Structure from a Bottleneck on Sequential Information Processing. CoRR abs/2405.12109 (2024) - [i15]Yash Sarrof, Yana Veitsman, Michael Hahn:
The Expressive Capacity of State Space Models: A Formal Language Perspective. CoRR abs/2405.17394 (2024) - [i14]Xinting Huang, Madhur Panwar, Navin Goyal, Michael Hahn:
InversionView: A General-Purpose Method for Reading Information from Neural Activations. CoRR abs/2405.17653 (2024) - [i13]Satwik Bhattamishra, Michael Hahn, Phil Blunsom, Varun Kanade:
Separations in the Representational Capabilities of Transformers and Recurrent Architectures. CoRR abs/2406.09347 (2024) - [i12]Xinting Huang, Andy Yang, Satwik Bhattamishra, Yash Sarrof, Andreas Krebs, Hattie Zhou, Preetum Nakkiran, Michael Hahn:
A Formal Framework for Understanding Length Generalization in Transformers. CoRR abs/2410.02140 (2024) - 2023
- [j6]Thomas Hikaru Clark, Clara Meister, Tiago Pimentel, Michael Hahn, Ryan Cotterell, Richard Futrell, Roger Levy:
A Cross-Linguistic Pressure for Uniform Information Density in Word Order. Trans. Assoc. Comput. Linguistics 11: 1048-1065 (2023) - [c13]Hailin Hao, Michael Hahn, Elsi Kaiser:
How Do Syntactic Statistics and Semantic Plausibility Modulate Local Coherence Effects. CogSci 2023 - [i11]Michael Hahn, Navin Goyal:
A Theory of Emergent In-Context Learning as Implicit Structure Induction. CoRR abs/2303.07971 (2023) - [i10]Thomas Hikaru Clark, Clara Meister, Tiago Pimentel, Michael Hahn, Ryan Cotterell, Richard Futrell, Roger Levy:
A Cross-Linguistic Pressure for Uniform Information Density in Word Order. CoRR abs/2306.03734 (2023) - 2022
- [c12]Neil Rathi, Michael Hahn, Richard Futrell:
Explaining patterns of fusion in morphological paradigms using the memory-surprisal tradeoff. CogSci 2022 - [c11]Songpeng Yan, Michael Hahn, Frank Keller:
Modeling Fixation Behavior in Reading with Character-level Neural Attention. CogSci 2022 - [i9]Michael Hahn, Yang Xu:
Crosslinguistic word order variation reflects evolutionary pressures of dependency and information locality. CoRR abs/2206.04239 (2022) - 2021
- [j5]Michael Hahn, Dan Jurafsky, Richard Futrell:
Sensitivity as a Complexity Measure for Sequence Classification Tasks. Trans. Assoc. Comput. Linguistics 9: 891-908 (2021) - [c10]Neil Rathi, Michael Hahn, Richard Futrell:
An Information-Theoretic Characterization of Morphological Fusion. EMNLP (1) 2021: 10115-10120 - [i8]Michael Hahn, Dan Jurafsky, Richard Futrell:
Sensitivity as a Complexity Measure for Sequence Classification Tasks. CoRR abs/2104.10343 (2021) - 2020
- [j4]Michael Hahn:
Theoretical Limitations of Self-Attention in Neural Sequence Models. Trans. Assoc. Comput. Linguistics 8: 156-171 (2020) - [c9]John Hewitt, Michael Hahn, Surya Ganguli, Percy Liang, Christopher D. Manning:
RNNs can generate bounded hierarchical languages with optimal memory. EMNLP (1) 2020: 1978-2010 - [i7]John Hewitt, Michael Hahn, Surya Ganguli, Percy Liang, Christopher D. Manning:
RNNs can generate bounded hierarchical languages with optimal memory. CoRR abs/2010.07515 (2020)
2010 – 2019
- 2019
- [j3]Michael Hahn, Richard Futrell:
Estimating Predictive Rate-Distortion Curves via Neural Variational Inference. Entropy 21(7): 640 (2019) - [j2]Michael Hahn, Marco Baroni:
Tabula nearly rasa: Probing the linguistic knowledge of character-level neural language models trained on unsegmented text. Trans. Assoc. Comput. Linguistics 7: 467-484 (2019) - [c8]Michael Hahn, Frank Keller, Yonatan Bisk, Yonatan Belinkov:
Character-based Surprisal as a Model of Reading Difficulty in the Presence of Errors. CogSci 2019: 401-407 - [i6]Michael Hahn, Frank Keller, Yonatan Bisk, Yonatan Belinkov:
Character-based Surprisal as a Model of Human Reading in the Presence of Errors. CoRR abs/1902.00595 (2019) - [i5]Michael Hahn:
Theoretical Limitations of Self-Attention in Neural Sequence Models. CoRR abs/1906.06755 (2019) - [i4]Michael Hahn, Marco Baroni:
Tabula nearly rasa: Probing the Linguistic Knowledge of Character-Level Neural Language Models Trained on Unsegmented Text. CoRR abs/1906.07285 (2019) - [i3]Michael Hahn, Andreas Krebs, Howard Straubing:
Wreath Products of Distributive Forest Algebras. CoRR abs/1911.03493 (2019) - 2018
- [c7]Michael Hahn, Judith Degen, Noah D. Goodman, Dan Jurafsky, Richard Futrell:
An Information-Theoretic Explanation of Adjective Ordering Preferences. CogSci 2018 - [c6]Michael Hahn, Andreas Krebs, Howard Straubing:
Wreath Products of Distributive Forest Algebras. LICS 2018: 512-520 - [i2]Michael Hahn, Frank Keller:
Modeling Task Effects in Human Reading with Neural Attention. CoRR abs/1808.00054 (2018) - 2016
- [c5]Michael Hahn, Frank Keller:
Modeling Human Reading with Neural Attention. EMNLP 2016: 85-95 - [i1]Michael Hahn, Frank Keller:
Modeling Human Reading with Neural Attention. CoRR abs/1608.05604 (2016) - 2015
- [j1]Michael Hahn, Frank Richter:
Henkin semantics for reasoning with natural language. J. Lang. Model. 3(2): 513-568 (2015) - [c4]Michael Hahn, Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig:
Visibly Counter Languages and the Structure of NC1. MFCS (2) 2015: 384-394 - 2013
- [c3]Niels Ott, Ramon Ziai, Michael Hahn, Detmar Meurers:
CoMeT: Integrating different levels of linguistic modeling for meaning assessment. SemEval@NAACL-HLT 2013: 608-616 - 2012
- [c2]Michael Hahn, Detmar Meurers:
Evaluating the Meaning of Answers to Reading Comprehension Questions: A Semantics-Based Approach. BEA@NAACL-HLT 2012: 326-336 - 2011
- [c1]Michael Hahn, Detmar Meurers:
On deriving semantic representations from dependencies: A Practical approach for evaluating meaning in learner corpora. DepLing 2011: 62-77
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 2024-11-08 20:33 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:
