default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Hardt
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Yann Georg Büchau
, Hasan Mashni, Matteo Bramati, Vasileios Savvakis, Ines Schäfer, Saskia Jung, Gabriela Miranda-Garcia, Daniel Hardt, Jens Bange:
PARMESAN: Meteorological Timeseries and Turbulence Analysis Backed by Symbolic Mathematics. J. Open Source Softw. 9(94): 6127 (2024)- 2023
- [j7]Ojelanki K. Ngwenyama, Helle Zinner Henriksen, Daniel Hardt:
PUBLIC MANAGEMENT CHALLENGES IN THE DIGITAL RISK SOCIETY: A Critical Analysis of the Public Debate on Implementation of the Danish NemID. Eur. J. Inf. Syst. 32(2): 108-126 (2023) - [c25]Daniel Hardt:
Ellipsis-Dependent Reasoning: a New Challenge for Large Language Models. ACL (2) 2023: 39-47 - 2021
- [c24]Rahul Aralikatte, Matthew Lamm, Daniel Hardt, Anders Søgaard:
Ellipsis Resolution as Question Answering: An Evaluation. EACL 2021: 810-817 - [c23]Sotiris Lamprinidis, Federico Bianchi, Daniel Hardt, Dirk Hovy:
Universal Joy A Data Set and Results for Classifying Emotions Across Languages. WASSA@EACL 2021: 62-75 - 2020
- [c22]Fredrik Ahnve, Kasper Fantenberg, Gustav Svensson, Daniel Hardt:
Predicting Stock Price Movements with Text Data using Labeling based on Financial Theory. IEEE BigData 2020: 4365-4372
2010 – 2019
- 2019
- [c21]Maxim van Oldenbeek, Till J. Winkler, Julie Buhl-Wiggers, Daniel Hardt:
Nudging in Blended Learning: Evaluation of Email-based progress feedback in a Flipped-Classroom Information Systems Course. ECIS 2019 - [i2]Rahul Aralikatte, Matthew Lamm, Daniel Hardt, Anders Søgaard:
Ellipsis and Coreference Resolution as Question Answering. CoRR abs/1908.11141 (2019) - 2018
- [j6]Emilio Carrizosa, Vanesa Guerrero, Daniel Hardt, Dolores Romero Morales:
On Building Online Visualization Maps for News Data Streams by Means of Mathematical Optimization. Big Data 6(2): 139-158 (2018) - [c20]Ola Rønning, Daniel Hardt, Anders Søgaard:
Linguistic representations in multi-task neural networks for ellipsis resolution. BlackboxNLP@EMNLP 2018: 66-73 - [c19]Sotiris Lamprinidis, Daniel Hardt, Dirk Hovy:
Predicting News Headline Popularity with Syntactic and Semantic Knowledge Using Multi-Task Learning. EMNLP 2018: 659-664 - [c18]Austin Baird, Anissa Hamza, Daniel Hardt:
Classifying Sluice Occurrences in Dialogue. LREC 2018 - [c17]Ola Rønning, Daniel Hardt, Anders Søgaard:
Sluice Resolution without Hand-Crafted Features over Brittle Syntax Trees. NAACL-HLT (2) 2018: 236-241 - 2017
- [c16]Daniel Hardt, Owen Rambow:
Predicting User Views in Online News. NLPmJ@EMNLP 2017: 7-12 - 2016
- [c15]Christopher J. Zimmerman, Mari-Klara Stein, Daniel Hardt, Christian Danielsen, Ravikiran Vatrapu:
emotionVis: Designing an Emotion Text Inference Tool for Visual Analytics. DESRIST 2016: 238-244 - [c14]Pranav Anand, Daniel Hardt:
Antecedent Selection for Sluicing: Structure and Content. EMNLP 2016: 1234-1243 - 2015
- [c13]Christopher J. Zimmerman, Mari-Klara Stein, Daniel Hardt, Ravi Vatrapu:
Emergence of Things Felt: Harnessing the Semantic Space of Facebook Feeling Tags. ICIS 2015 - 2014
- [c12]Julie Wulff, Daniel Hardt:
Can You Trust Online Ratings? Evidence of Systematic Differences in User Populations. ECIS 2014 - 2013
- [j5]Daniel Hardt:
A Uniform Syntax and Discourse Structure: the Copenhagen Dependency Treebanks. Dialogue Discourse 4(2): 53-64 (2013) - 2012
- [c11]Daniel Hardt, Julie Wulff:
What is the meaning of 5 *'s? An investigation of the expression and rating of sentiment. KONVENS 2012: 319-326 - 2011
- [c10]Daniel Hardt, Line Mikkelsen, Bjarne Ørsnes:
Sameness, Ellipsis and Anaphora. Amsterdam Colloquium on Logic, Language and Meaning 2011: 341-350 - 2010
- [c9]Daniel Hardt, Jakob Elming:
Incremental Re-training for Post-editing SMT. AMTA 2010
2000 – 2009
- 2006
- [j4]Daniel Hardt:
Marjorie J. McShane, A Theory of Ellipsis. Mach. Transl. 20(3): 221-222 (2006) - 2005
- [c8]Peter Rossen Skadhauge, Daniel Hardt:
Syntactic Identification of Attribution in the RST Treebank. LINC@IJCNLP 2005 - [c7]Daniel Hardt:
Natural Language Inference as Triggered Submodel Search. FLAIRS 2005: 524-528 - 2004
- [j3]Daniel Hardt, Maribel Romero:
Ellipsis and the Structure of Discourse. J. Semant. 21(4): 375-414 (2004) - 2001
- [j2]Nicholas Asher, Daniel Hardt, Joan Busquets:
Discourse parallelism, ellipsis, and ambiguity. J. Semant. 18(1): 1-25 (2001) - [c6]Daniel Hardt, Owen Rambow:
Generation of VP Ellipsis: A Corpus-Based Approach. ACL 2001: 282-289
1990 – 1999
- 1998
- [i1]Daniel Hardt:
Centering in Dynamic Semantics. CoRR cmp-lg/9807003 (1998) - 1997
- [j1]Daniel Hardt:
An Empirical Approach to VP Ellipsis. Comput. Linguistics 23(4): 525-541 (1997) - 1996
- [c5]Daniel Hardt:
Centering in Dynamic Semantics. COLING 1996: 519-524 - 1995
- [c4]Lillian N. Cassel, Robert E. Beck, Daniel Hardt:
Computing and the understanding of text. WCCE 1995: 669-677 - 1992
- [c3]Daniel Hardt:
An Algorithm for VP Ellipsis. ACL 1992: 9-14 - [c2]Daniel Hardt:
Some Problematic Cases of VP Ellipsis. ACL 1992: 276-278 - [c1]Daniel Hardt:
VP Ellipsis and Contextual Interpretation. COLING 1992: 303-309
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-04-25 05:47 CEST 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:
