var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https://teichert.github.io/assets/bib/teichert.bib&jsonp=1&nocache=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https://teichert.github.io/assets/bib/teichert.bib&jsonp=1&nocache=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https://teichert.github.io/assets/bib/teichert.bib&jsonp=1&nocache=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2022\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Graded Decompositional Semantic Prediction.\n \n \n \n \n\n\n \n Teichert, A. R.\n\n\n \n\n\n\n 2022.\n \n\n\n\n
\n\n\n\n \n \n \"GradedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@dissertation{teichert-2022-dissertation,\n  author = {Teichert, Adam R.},\n  title  = {{Graded Decompositional Semantic Prediction}},\n  url    = {https://jscholarship.library.jhu.edu/handle/1774.2/67535},\n  year   = {2022},\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Neural Davidsonian Semantic Proto-role Labeling.\n \n \n \n \n\n\n \n Rudinger, R.; Teichert, A.; Culkin, R.; Zhang, S.; and Van Durme, B.\n\n\n \n\n\n\n In Empirical Methods in Natural Language Processing (EMNLP), 2018. \n \n\n\n\n
\n\n\n\n \n \n \"NeuralPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{neural-davidsonian-semantic-proto-role-labeling,\n  author    = {Rudinger, Rachel and Teichert, Adam and Culkin, Ryan and Zhang, Sheng and {Van Durme}, Benjamin},\n  booktitle = {Empirical Methods in Natural Language Processing (EMNLP)},\n  numpages  = {12},\n  title     = {{Neural Davidsonian Semantic Proto-role Labeling}},\n  url       = {http://aclweb.org/anthology/D18-1114},\n  year      = {2018},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Semantic Proto-Role Labeling.\n \n \n \n \n\n\n \n Teichert, A.; Poliak, A.; Van Durme, B.; and Gormley, M.\n\n\n \n\n\n\n In AAAI Conference on Artificial Intelligence (AAAI), 2017. \n \n\n\n\n
\n\n\n\n \n \n \"SemanticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{semantic-proto-role-labeling,\n  author    = {Teichert, Adam and Poliak, Adam and {Van Durme}, Benjamin and Gormley, Matthew},\n  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},\n  numpages  = {7},\n  title     = {{Semantic Proto-Role Labeling}},\n  url       = {https://doi.org/10.1609/aaai.v31i1.11165},\n  year      = {2017},\n} \n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Faster (and Better) Entity Linking with Cascades.\n \n \n \n \n\n\n \n Benton, A.; Deyoung, J.; Teichert, A.; Dredze, M.; Van Durme, B.; Mayhew, S.; and Thomas, M.\n\n\n \n\n\n\n In NIPS Workshop on Automated Knowledge Base Construction (AKBC), 2014. \n \n\n\n\n
\n\n\n\n \n \n \"FasterPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{faster-and-better-entity-linking-with-cascades,\n  author    = {Benton, Adrian and Deyoung, Jay and Teichert, Adam and Dredze, Mark and {Van Durme}, Benjamin and Mayhew, Stephen and Thomas, Max},\n  booktitle = {NIPS Workshop on Automated Knowledge Base Construction (AKBC)},\n  numpages  = {6},\n  title     = {{Faster (and Better) Entity Linking with Cascades}},\n  url       = {http://www.akbc.ws/2014/submissions/akbc2014_submission_1.pdf},\n  year      = {2014},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Learning to translate with products of novices: a suite of open-ended challenge problems for teaching MT.\n \n \n \n \n\n\n \n Lopez, A.; Post, M.; Callison-Burch, C.; Weese, J.; Ganitkevitch, J.; Ahmidi, N.; Buzek, O.; Hanson, L.; Jamil, B.; Lee, M.; Lin, Y.; Pao, H.; Rivera, F.; Shahriyari, L.; Sinha, D.; Teichert, A.; Wampler, S.; Weinberger, M.; Xu, D.; Yang, L.; and Zhao, S.\n\n\n \n\n\n\n Transactions of the Association for Computational Linguistics, 1: 165–178. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"LearningPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{lopez-etal-2013-learning,\n  abstract = {Machine translation (MT) draws from several different disciplines, making it a complex subject to teach. There are excellent pedagogical texts, but problems in MT and current algorithms for solving them are best learned by doing. As a centerpiece of our MT course, we devised a series of open-ended challenges for students in which the goal was to improve performance on carefully constrained instances of four key MT tasks: alignment, decoding, evaluation, and reranking. Students brought a diverse set of techniques to the problems, including some novel solutions which performed remarkably well. A surprising and exciting outcome was that student solutions or their combinations fared competitively on some tasks, demonstrating that even newcomers to the field can help improve the state-of-the-art on hard NLP problems while simultaneously learning a great deal. The problems, baseline code, and results are freely available.},\n  author   = {Lopez, Adam  and\n              Post, Matt  and\n              Callison-Burch, Chris  and\n              Weese, Jonathan  and\n              Ganitkevitch, Juri  and\n              Ahmidi, Narges  and\n              Buzek, Olivia  and\n              Hanson, Leah  and\n              Jamil, Beenish  and\n              Lee, Matthias  and\n              Lin, Ya-Ting  and\n              Pao, Henry  and\n              Rivera, Fatima  and\n              Shahriyari, Leili  and\n              Sinha, Debu  and\n              Teichert, Adam  and\n              Wampler, Stephen  and\n              Weinberger, Michael  and\n              Xu, Daguang  and\n              Yang, Lin  and\n              Zhao, Shang},\n  doi      = {10.1162/tacl_a_00218},\n  journal  = {Transactions of the Association for Computational Linguistics},\n  pages    = {165--178},\n  title    = {Learning to translate with products of novices: a suite of open-ended challenge problems for teaching {MT}},\n  url      = {https://www.aclweb.org/anthology/Q13-1014},\n  volume   = {1},\n  year     = {2013},\n}\n\n
\n
\n\n\n
\n Machine translation (MT) draws from several different disciplines, making it a complex subject to teach. There are excellent pedagogical texts, but problems in MT and current algorithms for solving them are best learned by doing. As a centerpiece of our MT course, we devised a series of open-ended challenges for students in which the goal was to improve performance on carefully constrained instances of four key MT tasks: alignment, decoding, evaluation, and reranking. Students brought a diverse set of techniques to the problems, including some novel solutions which performed remarkably well. A surprising and exciting outcome was that student solutions or their combinations fared competitively on some tasks, demonstrating that even newcomers to the field can help improve the state-of-the-art on hard NLP problems while simultaneously learning a great deal. The problems, baseline code, and results are freely available.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Learned Prioritization for Trading Off Accuracy and Speed.\n \n \n \n \n\n\n \n Jiang, J.; Teichert, A.; Daumé III, H.; and Eisner, J.\n\n\n \n\n\n\n In ICML Workshop on Inferning: Interactions between Inference and Learning, Edinburgh, June 2012. \n 7 pages\n\n\n\n
\n\n\n\n \n \n \"LearnedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{jiang-et-al-2012-icmlw,\n  address   = {Edinburgh},\n  author    = {Jiarong Jiang and Adam Teichert and Hal {Daum\\'{e}\n               III} and Jason Eisner},\n  booktitle = {ICML Workshop on Inferning: Interactions between\n               Inference and Learning},\n  month     = jun,\n  note      = {7 pages},\n  title     = {Learned Prioritization for Trading Off Accuracy and\n               Speed},\n  url       = {http://cs.jhu.edu/~jason/papers/#jiang-et-al-2012-icmlw},\n  year      = {2012},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Learned Prioritization for Trading Off Accuracy and Speed.\n \n \n \n \n\n\n \n Jiang, J.; Teichert, A.; Eisner, J.; and Daume, H.\n\n\n \n\n\n\n In Pereira, F.; Burges, C. J. C.; Bottou, L.; and Weinberger, K. Q., editor(s), Advances in Neural Information Processing Systems 25, pages 1331–1339. Curran Associates, Inc., 2012.\n \n\n\n\n
\n\n\n\n \n \n \"LearnedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@incollection{jiang-et-al-2012-nips,\n  author    = {Jiarong Jiang and Adam Teichert and Jason Eisner and Hal Daume},\n  booktitle = {Advances in Neural Information Processing Systems 25},\n  editor    = {F. Pereira and C. J. C. Burges and L. Bottou and K. Q. Weinberger},\n  pages     = {1331--1339},\n  publisher = {Curran Associates, Inc.},\n  title     = {Learned Prioritization for Trading Off Accuracy and Speed},\n  url       = {http://papers.nips.cc/paper/4556-learned-prioritization-for-trading-off-accuracy-and-speed.pdf},\n  year      = {2012},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An Open Source Phylogenetic Search and Alignment Package.\n \n \n \n \n\n\n \n Carroll, H.; Teichert, A. R.; Krein, J.; Sundberg, K.; Snell, Q.; and Clement, M.\n\n\n \n\n\n\n Int. J. Bioinformatics Res. Appl., 5(3): 349–364. June 2009.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n 
@article{carroll-et-al-2009-ijbra,\n  acmid      = {1554587},\n  address    = {Inderscience Publishers, Geneva, SWITZERLAND},\n  author     = {Carroll, Hyrum and Teichert, Adam R. and Krein, Jonathan and Sundberg, Kenneth and Snell, Quinn and Clement, Mark},\n  doi        = {10.1504/IJBRA.2009.026424},\n  issn       = {1744-5485},\n  issue_date = {June 2009},\n  journal    = {Int. J. Bioinformatics Res. Appl.},\n  keywords   = {PSODA, PsodaScript, bioinformatics, open source, phylogenetic alignment, phylogenetic inference, phylogenetic search, visualisation},\n  month      = jun,\n  number     = {3},\n  numpages   = {16},\n  pages      = {349--364},\n  publisher  = {Inderscience Publishers},\n  title      = {An Open Source Phylogenetic Search and Alignment Package},\n  url        = {http://dx.doi.org/10.1504/IJBRA.2009.026424},\n  volume     = {5},\n  year       = {2009},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Unsupervised Part of Speech Tagging Without a Lexicon.\n \n \n \n \n\n\n \n Teichert, A. R.; and Daumé III, H.\n\n\n \n\n\n\n In NIPS Workshop on Grammar Induction, Representation of Language and Language Learning (GIRLLL), Vancouver, Canada, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"UnsupervisedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{daume09typpos,\n  address   = {Vancouver, Canada},\n  author    = {Adam R. Teichert and Hal {Daum\\'e III}},\n  booktitle = {NIPS Workshop on Grammar Induction, Representation of Language and\n               Language Learning (GIRLLL)},\n  title     = {Unsupervised Part of Speech Tagging Without a Lexicon},\n  url       = {http://hal3.name/docs/#daume09typpos},\n  year      = {2009},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2007\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n PsodaScript: applying advanced language constructs to open-source phylogenetic search.\n \n \n \n\n\n \n Krein, J. L; Teichert, A. R; Carroll, H. D; Clement, M. J; and Snell, Q. O\n\n\n \n\n\n\n In Proceedings of the 4th Biotechnology and Bioinformatics Symposium (BIOT-07), pages 89–94, 2007. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{krein2007psodascript,\n  author    = {Krein, Jonathan L and Teichert, Adam R and Carroll, Hyrum D and Clement, Mark J and Snell, Quinn O},\n  booktitle = {Proceedings of the 4th Biotechnology and Bioinformatics Symposium (BIOT-07)},\n  pages     = {89--94},\n  title     = {PsodaScript: applying advanced language constructs to open-source phylogenetic search},\n  year      = {2007},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);