default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Quernheim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j3]Thomas Hanneforth, Andreas Maletti, Daniel Quernheim:
Pushing for weighted tree automata. Log. Methods Comput. Sci. 14(1) (2018)- 2017
- [b1]Daniel Quernheim:
Bimorphism Machine Translation. Leipzig University, Germany, 2017 - [i2]Thomas Hanneforth, Andreas Maletti, Daniel Quernheim:
Pushing for weighted tree automata. CoRR abs/1702.00304 (2017) - 2015
- [c12]Daniel Quernheim:
Exact Decoding with Multi Bottom-Up Tree Transducers. WMT@EMNLP 2015: 164-171 - 2014
- [c11]Daniel Quernheim, Fabienne Cap:
Large-scale Exact Decoding: The IMS-TTT submission to WMT14. WMT@ACL 2014: 163-170 - [c10]Andreas Maletti, Daniel Quernheim:
Hyper-Minimization for Deterministic Weighted Tree Automata. AFL 2014: 314-326 - 2013
- [c9]Fabienne Braune, Nina Seemann, Daniel Quernheim, Andreas Maletti:
Shallow Local Multi-Bottom-up Tree Transducers in Statistical Machine Translation. ACL (1) 2013: 811-821 - [c8]Thomas Hanneforth, Andreas Maletti, Daniel Quernheim:
Random Generation of Nondeterministic Finite-State Tree Automata. TTATT 2013: 11-16 - 2012
- [j2]Andreas Maletti, Daniel Quernheim:
Unweighted and Weighted Hyper-Minimization. Int. J. Found. Comput. Sci. 23(6): 1207-1226 (2012) - [c7]Nina Seemann, Daniel Quernheim, Fabienne Braune, Andreas Maletti:
Preservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers. ATANLP@EACL 2012: 1-10 - [c6]Aurélie Lagoutte, Fabienne Braune, Daniel Quernheim, Andreas Maletti:
Composing extended top-down tree transducers. EACL 2012: 808-817 - [c5]Daniel Quernheim, Kevin Knight:
DAGGER: A Toolkit for Automata on Directed Acyclic Graphs. FSMNLP 2012: 40-44 - [c4]Daniel Quernheim, Kevin Knight:
Towards Probabilistic Acceptors and Transducers for Feature Structures. SSST@ACL 2012: 76-85 - 2011
- [j1]Andreas Maletti, Daniel Quernheim:
Optimal Hyper-Minimization. Int. J. Found. Comput. Sci. 22(8): 1877-1891 (2011) - [c3]Andreas Maletti, Daniel Quernheim:
Hyper-minimisation of deterministic weighted finite automata over semifields. AFL 2011: 285-299 - [c2]Andreas Maletti, Daniel Quernheim:
Pushing for Weighted Tree Automata. MFCS 2011: 460-471 - [i1]Andreas Maletti, Daniel Quernheim:
Optimal Hyper-Minimization. CoRR abs/1104.3007 (2011)
2000 – 2009
- 2008
- [c1]Wolfgang Seeker, Daniel Quernheim:
Optimality Theory and Vector Semirings. FSMNLP 2008: 134-145
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:54 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:
