


default search action
Mark Hopkins
Person information
- affiliation: AI2, Allen Institute for Artificial Intelligence, Seattle, US
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i5]Maxim Enis, Mark Hopkins:
From LLM to NMT: Advancing Low-Resource Machine Translation with Claude. CoRR abs/2404.13813 (2024) - 2023
- [j3]Ananthan Nambiar
, Simon Liu, Maeve Heflin, John Malcolm Forsyth, Sergei Maslov, Mark Hopkins, Anna M. Ritz
:
Transformer Neural Networks for Protein Family and Interaction Prediction Tasks. J. Comput. Biol. 30(1): 95-111 (2023) - [c28]Mark Hopkins
, Hans Leiß
:
Normal Forms for Elements of the *-continuous Kleene Algebras $K\mathop {\otimes _\mathcal{R}}C_2'$. RAMiCS 2023: 122-139 - [c27]Zhengyao Gu, Mark Hopkins:
On the Evaluation of Neural Selective Prediction Methods for Natural Language Processing. ACL (1) 2023: 7888-7899 - [i4]Mark Hopkins, Hans Leiß:
Normal Forms for Elements of the *-Continuous Kleene Algebras K ⊗R C2'. CoRR abs/2310.17295 (2023) - 2022
- [c26]Mark Hopkins:
Towards More Natural Artificial Languages. CoNLL 2022: 85-94 - 2020
- [c25]Ananthan Nambiar, Maeve Heflin, Simon Liu
, Sergei Maslov
, Mark Hopkins, Anna M. Ritz:
Transforming the Language of Life: Transformer Neural Networks for Protein Prediction Tasks. BCB 2020: 5:1-5:8 - [c24]Vinay Gopalan, Mark Hopkins:
Reed at SemEval-2020 Task 9: Fine-Tuning and Bag-of-Words Approaches to Code-Mixed Sentiment Analysis. SemEval@COLING 2020: 1304-1309 - [i3]Vinay Gopalan, Mark Hopkins:
Reed at SemEval-2020 Task 9: Sentiment Analysis on Code-Mixed Tweets. CoRR abs/2007.13061 (2020)
2010 – 2019
- 2019
- [c23]Mark Hopkins, Ronan Le Bras, Cristian Petrescu-Prahova, Gabriel Stanovsky, Hannaneh Hajishirzi, Rik Koncel-Kedziorski:
SemEval-2019 Task 10: Math Question Answering. SemEval@NAACL-HLT 2019: 893-899 - 2018
- [c22]Hans Leiß, Mark Hopkins:
C-Dioids and \mu -Continuous Chomsky-Algebras. RAMiCS 2018: 21-36 - [c21]Mark Hopkins, Hans Leiß:
Coequalizers and Tensor Products for Continuous Idempotent Semirings. RAMiCS 2018: 37-52 - [c20]Vidur Joshi, Matthew E. Peters, Mark Hopkins:
Extending a Parser to Distant Domains Using a Few Dozen Partially Annotated Examples. ACL (1) 2018: 1190-1199 - [c19]Gabriel Stanovsky, Mark Hopkins:
Spot the Odd Man Out: Exploring the Associative Power of Lexical Resources. EMNLP 2018: 1533-1542 - [i2]Vidur Joshi, Matthew E. Peters, Mark Hopkins:
Extending a Parser to Distant Domains Using a Few Dozen Partially Annotated Examples. CoRR abs/1805.06556 (2018) - 2017
- [c18]Aaron Sarnat, Vidur Joshi, Cristian Petrescu-Prahova, Alvaro Herrasti, Brandon Stilson, Mark Hopkins:
Interactive Visualization for Linguistic Structure. EMNLP (System Demonstrations) 2017: 49-54 - [c17]Mark Hopkins, Cristian Petrescu-Prahova, Roie Levin, Ronan Le Bras, Alvaro Herrasti, Vidur Joshi:
Beyond Sentential Semantic Parsing: Tackling the Math SAT with a Cascade of Tree Transducers. EMNLP 2017: 795-804 - 2014
- [c16]Laura Jehl, Adrià de Gispert, Mark Hopkins, Bill Byrne:
Source-side Preordering for Translation using Logistic Regression and Depth-first Branch-and-Bound Search. EACL 2014: 239-248 - 2013
- [c15]Mark Hopkins, Jonathan May:
Models of Translation Competitions. ACL (1) 2013: 1416-1424 - 2012
- [i1]Mark Hopkins:
LAYERWIDTH: Analysis of a New Metric for Directed Acyclic Graphs. CoRR abs/1212.2479 (2012) - 2011
- [c14]Mark Hopkins, Jonathan May:
Tuning as Ranking. EMNLP 2011: 1352-1362 - [c13]Mark Hopkins, Greg Langmead, Tai Vo:
Extraction Programs: A Unified Approach to Translation Rule Extraction. WMT@EMNLP 2011: 523-532 - 2010
- [c12]Mark Hopkins, Greg Langmead:
SCFG Decoding Without Binarization. EMNLP 2010: 646-655
2000 – 2009
- 2009
- [j2]Andreas Maletti, Jonathan Graehl, Mark Hopkins, Kevin Knight:
The Power of Extended Top-Down Tree Transducers. SIAM J. Comput. 39(2): 410-430 (2009) - [c11]Mark Hopkins, Greg Langmead:
Cube Pruning as Heuristic Search. EMNLP 2009: 62-71 - 2008
- [c10]Mark Hopkins:
The Algebraic Approach I: The Algebraization of the Chomsky Hierarchy. RelMiCS 2008: 155-172 - [c9]Mark Hopkins:
The Algebraic Approach II: Dioids, Quantales and Monads. RelMiCS 2008: 173-190 - 2007
- [j1]Mark Hopkins, Judea Pearl:
Causality and Counterfactuals in the Situation Calculus. J. Log. Comput. 17(5): 939-953 (2007) - [c8]Mark Hopkins, Jonas Kuhn:
Machine Translation as Tree Labeling. SSST@HLT-NAACL 2007: 41-48 - 2006
- [c7]Mark Hopkins, Jonas Kuhn:
Exploring the Potential of Intractable Parsers. ACL 2006 - 2004
- [c6]Mark Hopkins:
Nomadic platform approach for wireless mobile multimedia. DAC 2004: 408 - [c5]Michel Galley, Mark Hopkins, Kevin Knight, Daniel Marcu:
What's in a translation rule? HLT-NAACL 2004: 273-280 - 2003
- [c4]Mark Hopkins:
Layerwidth: Analysis of a New Metric for Directed Acyclic Graphs. UAI 2003: 321-328 - 2002
- [c3]Mark Hopkins:
Strategies for Determining Causes of Events. AAAI/IAAI 2002: 546-552 - [c2]Mark Hopkins, Adnan Darwiche:
A Practical Relaxation of Constant-Factor Treewidth Approximation Algorithms. Probabilistic Graphical Models 2002 - 2001
- [c1]Adnan Darwiche, Mark Hopkins:
Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees. ECSQARU 2001: 180-191
1990 – 1999
- 1999
- [d1]Mark Hopkins, Erik Reeber, George Forman, Jaap Suermondt:
Spambase. UCI Machine Learning Repository, 1999
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-06-19 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint