JASON M. EISNER
Curriculum Vitae (PDF)

Email:	jason@cs.jhu.edu
Home page:	http://cs.jhu.edu/~jason
Phone:	(410) 516-8438
Fax:	(410) 516-6134

Snailmail:

Department of Computer Science, NEB 224
Johns Hopkins University
3400 N. Charles St.
Baltimore, MD 21218-2691
U.S.A.

Education and Honors

2001	Univ. of Pennsylvania	Ph.D. in Computer Science. Thesis: Smoothing a probabilistic lexicon via syntactic transformations. Advisor: Mitch Marcus. Graduate Teaching Award.
1993	Univ. of Cambridge	B.A. / M.A. in Mathematics (first-class honours). (Note: Second undergraduate degree.)
1990	Harvard Univ.	A.B. in Psychology, Cognitive Science track (summa cum laude; junior-year election to Phi Beta Kappa).

Professional Experience

7/2000-		Department of Computer Science, Johns Hopkins University
	Assistant professor of computer science. Joint appointment in Cognitive Science (1/2003-).
1/2000-6/2001		Department of Computer Science, University of Rochester, NY
	Assistant professor of computer science. Secondary appointment in Linguistics.
1994-		iReactor Inc., Philadelphia, PA (consultant)
	Solved research problems, wrote patents, proposed commercial ventures and strategies, met with potential clients, and supervised programmers, on a variety of Internet-oriented research projects.
1989-1992		AT&T Bell Labs, AI Research Department, Murray Hill, NJ (summers)
	Designed and built an early probabilistic left-to-right parser. Final version used a Lexical-Functional unification grammar and incorporated semantic and speech-recognition probabilities. Publications describe earlier version.
1988		Microsoft Corporation, Seattle, WA (summer)
	Designed a flexible, high-performance multi-line editor widget for OS/2 Presentation Manager, and led the team that implemented it in C.
1987-1988		IBM Research Center, Yorktown Heights, NY (consultant)
	Designed interactive system to help navigate company budget performance data.

Professional Activities

President, ACL SIG for Computational Morphology and Phonology (2001-); executive committee (1998-).
Editorial board, Research in Language and Computation (2006-2011).
Planning committee, Computational Linguistics Olympiad (2006-).
Advisory board member, cogito.org (2005-).
Program area chair, EMNLP (2006, for machine learning).
Program area co-chair, HLT-NAACL (2006, for syntax/grammar/morphology).
Program area chair, EACL (2006, for phonology/morphology/finite-state/tagging/segmentation).
Publications chair, ACL (2005). Co-chair for HLT/NAACL Tutorial and Workshop Programs (2003).
Special issue editor, Cognitive Science (2002).
Organizer, SIGPHON Workshop on Finite-State Phonology at COLING (2000).
Journal reviewer, Computational Linguistics (2005, 2004, 2002, 2001, 2000), ACM Transactions on Speech and Language Processing (2005), Cognition (2002), Language and Speech (1999), J. of Algorithms (1997).
Program committee for ACL (2005, 2004, 2003, 2002), EACL (2006, 2003, 1999), EMNLP (2006, 2003, 2002), FSMNLP (2005, 2001), ICML (2004), MITWPL (1999), NAACL (2006), SIGPHON (2006, 2004, 2002, 2000, 1998), TNLP (2005, 2002), Formal Approaches to Slavic Linguistics 8 (1999); reviewer for IJCAI (2007).
NSF panel reviewer (2004, 2003).
Lecturer, NAACL Summer School in Human Language Technology (2005, 2004, 2003, 2002).
Member, EU/NSF joint working group: "ePhilology: Emerging Language Technologies and the Rediscovery of the Past" (2002).

Fellowships and Awards

2005	Robert B. Pond, Sr. Excellence in Teaching Award	(JHU Engineering)
2002, 2005	Nominated for best paper award	(EMNLP, ACL)
1993-1996	NSF Graduate Research Fellowship	(U. Pennsylvania)
1993-1996	NSF Graduate Research Fellowship	(U. Pennsylvania)
1991-1993	Herchel Smith Harvard Scholarship	(Cambridge U.)
1990-1991	Fulbright Scholarship	(U. Cape Town)
1986-1990	Harvard National Scholarship	(Harvard U.)

Grants

2006-2007	JHU WSE-APL Partnership Fund: Learning with Less Systems	(PI, $68K)
2005-2010	NSF PIRE: Investigation of Meaning Representations in Language Understanding for Machine Translation Systems	(co-PI, $2.5M)
2004-2009	NSF CAREER: Finite-State Machine Learning on Strings and Sequences	(PI, $500K)
2003-2007	NSF ITR: Weighted Dynamic Programming for Statistical Natural Language Processing	(PI, $425K)
2001-2006	ONR: Improving Statistical Translation Models Via Text Analyzers Trained From Parallel Corpora	(co-PI, $4.3M)
2001-2006	NSF ITR/IM+PE+SY: Summer Workshops on Human Language Technology	(co-PI, $2.35M)

Publications and Presentations

Invited talks

2006. Bootstrapping Without the Boot. MITRE Corporation, August; IPAM Document Space Workshop, January.
2005-06. The Dyna Language. MIT, November 2006; IBM Yorktown Heights, May 2006; Microsoft Research, August 2005; University of Washington, August 2005.
2002-04. Parameterized Finite-State Machines and Their Training. U. of Saarland, Germany, March 2004; AT&T Research, October 2002.
2003. Inferring Transformations. Mathematics of Language Conference (MoL8), Bloomington.
2000. Learning Natural-Language Grammars using a Bayesian Prior. RIT, May. (Also at Johns Hopkins, February; UCLA Linguistics Dept., June 1999.)
1999. Doing OT in a Straitjacket. UCLA Linguistics Dept., June. (Also updated versions at U. Rochester Linguistics Dept., March 2000; Johns Hopkins Cognitive Science Dept., September 2002.)
1999. Job talks at Stanford, UT Austin, U. Toronto, U. Rochester, U. Chicago.
1997. Constraining OT: Primitive Optimality Theory. MIT Linguistics Dept., April.

Journal articles

Eng, John and Jason M. Eisner (2004). Radiology Report Entry with Automatic Phrase Completion Driven by Language Modeling. Radiographics 24(5):1493-1501, September-October.
Eisner, Jason (2002). Discovering syntactic deep structure via Bayesian statistics. Cognitive Science 26(3):255-268, May-June.
Eisner, Jason (2002). Introduction to the special section on linguistically apt statistical methods. Cognitive Science 26(3):235-237, May-June.

Book chapters

Eisner, Jason (2000). Bilexical grammars and their cubic-time parsing algorithms. In Harry Bunt and Anton Nijholt (eds.), Advances in Probabilistic and Other Parsing Technologies, pp. 29-62. Kluwer, October.

Book reviews

Eisner, Jason (2000). Review of Optimality Theory, by René Kager. Computational Linguistics 26(2):286-290, June.

Ph.D. thesis

Eisner, Jason (2001). Smoothing a Probabilistic Lexicon Via Syntactic Transformations. 318 pp. University of Pennsylvania.

Refereed conference and workshop proceedings

Mason, Joshua, Kathryn Watkins, Jason Eisner, and Adam Stubblefield (2006). A natural-language approach to automated cryptanalysis of two-time pads. Proceedings of the ACM Conference on Computer and Communications Security (CCS), 10 pp., Alexandria, VA, October.
Eisner, Jason and John Blatz (2006). Program transformations for optimization of parsing algorithms and other weighted logic programs. Pre-proceedings of the 11th Conference on Formal Grammar (FG-2006), pp. 39-59, Malaga, July. Revised version to appear in the post-proceedings from CSLI Publications.
Dreyer, Markus and Jason Eisner (2006). Better informed training of latent syntactic features. Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 317-326, Sydney, July.
Smith, David A. and Jason Eisner (2006). Minimum-risk annealing for training log-linear models. Proceedings of the International Conference on Computational Linguistics and the Association for Computational Linguistics (COLING-ACL), Companion Volume, pp. 787-794, Sydney, July.
Smith, Noah A. and Jason Eisner (2006). Annealing structural bias in multilingual weighted grammar induction. Proceedings of the International Conference on Computational Linguistics and the Association for Computational Linguistics (COLING-ACL), pp. 569-576, Sydney, July.
Eisner, Jason and Roy W. Tromble (2006). Local search with very large-scale neighborhoods for optimal permutations in machine translation. Proceedings of the HLT-NAACL Workshop on Computationally Hard Problems and Joint Inference in Speech and Language Processing, pp. 57-75, New York, June.
Smith, David A. and Jason Eisner (2006). Quasi-synchronous grammars: Alignment by soft projection of syntactic dependencies. Proceedings of the HLT-NAACL Workshop on Statistical Machine Translation, pp. 23-30, New York, June.
Tromble, Roy W. and Jason Eisner (2006). A fast finite-state relaxation method for enforcing global constraints on sequence decoding. Proceedings of HLT-NAACL, pp. 423-430, New York, June.
Eisner, Jason, and Noah A. Smith (2005). Parsing with soft and hard constraints on dependency length. Proceedings of the International Workshop on Parsing Technologies (IWPT), pp. 30-41, Vancouver, October.
Eisner, Jason and Damianos Karakos (2005). Bootstrapping without the boot. Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing (HLT-EMNLP), pp. 395-402, Vancouver, October.
Eisner, Jason, Eric Goldlust, and Noah A. Smith (2005). Compiling comp ling: Weighted dynamic programming and the Dyna language. Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing (HLT-EMNLP), pp. 281-290, Vancouver, October.
Smith, Noah A., and Jason Eisner (2005). Guiding unsupervised grammar induction using contrastive estimation. International Joint Conference on Artificial Intelligence (IJCAI) Workshop on Grammatical Inference Applications, pp. 73-82, Edinburgh, July.
Smith, Noah A., and Jason Eisner (2005). Contrastive estimation: Training log-linear models on unlabeled data. Proceedings of the 43rd Meeting of the Association for Computational Linguistics (ACL), pp. 354-362, Ann Arbor, Michigan, June. Nominated for best paper award.
Kempe, André, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, and Florent Nicart (2005). A class of rational n-WFSM auto-intersections. Proceedings of the Tenth International Conference on Implementation and Application of Automata (CIAA-2005). Lecture Notes in Computer Science 3845:189-200.
Kempe, Andre, Jean-Marc Champarnaud, and Jason Eisner (2004). A note on join and auto-intersection of n-ary rational relations. Proceedings of the Eindhoven FASTAR Days, pp. 64-78, December.
Eisner, Jason, Eric Goldlust, and Noah A. Smith (2004). Dyna: A declarative language for implementing dynamic programs. Proceedings of the 42st Meeting of the Association for Computational Linguistics (companion volume), pp. 218-221, Barcelona, July.
Smith, Noah A. and Jason Eisner (2004). Annealing techniques for unsupervised statistical language learning. Proceedings of the 42st Meeting of the Association for Computational Linguistics (ACL), pp. 486-493, Barcelona, July.
Eisner, Jason (2003). Learning non-isomorphic tree mappings for machine translation. Proceedings of the 41st Meeting of the Association for Computational Linguistics (companion volume), pp. 205-208, Sapporo, July.
Eisner, Jason (2003). Simpler and more general minimization for weighted finite-state automata. Proceedings of the Joint Meeting of the Human Language Technology Conference and the North American Chapter of the Association for Computational Linguistics (HLT-NAACL), pp. 64-71, Edmonton, May.
Eisner, Jason (2002). Parameter estimation for probabilistic finite-state transducers. Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, pp. 1-8, Philadelphia, July.
Eisner, Jason (2002). Comprehension and compilation in Optimality Theory. Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, pp. 56-63, Philadelphia, July.
Eisner, Jason (2002). An interactive spreadsheet for teaching the forward-backward algorithm. Proceedings of the ACL Workshop on Effective Tools and Methodologies for Teaching NLP and CL, pp. 10-18, Philadelphia, July.
Eisner, Jason (2002). Transformational priors over grammars. Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP), p. 63-70, Philadelphia, July. Nominated for best paper award.
Eisner, Jason (2001). Expectation Semirings: Flexible EM for Finite-State Transducers. Proceedings of the ESSLLI Workshop on Finite-State Methods in NLP (FSMNLP), 5 pp., Helsinki, August.
Eisner, Jason (2000). Easy and hard constraint ranking in Optimality Theory. Finite-State Phonology: Proceedings of the Fifth SIGPHON Workshop, pp. 22-33, Luxembourg, August.
Eisner, Jason (2000). Directional constraint evaluation in Optimality Theory. Proceedings of COLING-2000, pp. 257-263, Saarbrücken, Germany, August.
Eisner, Jason and Giorgio Satta (2000). A faster parsing algorithm for lexicalized tree-adjoining grammars. Proceedings of the 5th Workshop on Tree-Adjoining Grammars and Related Formalisms (TAG+5), pp. 14-19, Paris, May.
Eisner, Jason and Giorgio Satta (1999). Efficient parsing for bilexical context-free grammars and head automaton grammars. Proceedings of the 37th Annual Meeting of the ACL, pp. 457-464, College Park, Maryland, June.
Eisner, Jason (1997). Bilexical grammars and a cubic-time probabilistic parser. Proceedings of the International Workshop on Parsing Technologies (IWPT '97), pp. 54-65, MIT, September.
Eisner, Jason (1997). Efficient generation in primitive Optimality Theory. Proceedings of the 35th Annual Meeting of the ACL, pp. 313-320, Madrid, July.
Eisner, Jason (1997). FootForm decomposed: Using primitive constraints in OT. Proceedings of SCIL VII: MIT Working Papers in Linguistics, 31:115-143, edited by Benjamin Bruening.
Eisner, Jason M (1996). Three new probabilistic models for dependency parsing: An exploration. Proceedings of COLING-96, pp. 340-345, Copenhagen, August.
Eisner, Jason (1996). Efficient normal-form parsing for Combinatory Categorial Grammar. Proceedings of the 34th Annual Meeting of the ACL, pp. 79-86, Santa Cruz, June.
B. Baldwin, J.C. Reynar, M. Collins, J. Eisner, A. Ratnaparkhi, J. Rosenzweig, A. Sarkar, and B. Srinivas (1995). Description of the University of Pennsylvania entry in the MUC-6 competition. Proceedings of the Sixth Message Understanding Conference (MUC-6), pp. 177-191, Maryland, October.
Eisner, Jason (1995). `All'-less in Wonderland? Revisiting any. In Janet Fuller, Ho Han, and David Parkinson (eds.), Proceedings of ESCOL 11, pp. 92-103. Ithaca, NY: DMLL Publications.
Jones, Mark A., and Jason M. Eisner (1992). A probabilistic parser applied to software testing documents. Proceedings of National Conference on Artificial Intelligence (AAAI-92), pp. 322-328, San Jose.
Jones, Mark A., and Jason M. Eisner (1992). A probabilistic parser and its application. Proceedings of the AAAI-92 Workshop on Statistically-Based Natural Language Processing Techniques, pp. 20-27, San Jose.

Refereed presentations

Eisner, Jason, Michael Kornbluh, Gordon Woodhull, Raymond Buse, Samuel Huang, Constantinos Michael, and George Shafer (2006). Visual navigation through large directed graphs and hypergraphs. Electronic Proceedings of the IEEE Symposium on Information Visualization (InfoVis'06), Poster/Demo Session, 2 pp., Baltimore, October.
Eisner, Jason M (1997). Pinning down Gen and Con for phonology. Hopkins Optimality Theory Workshop (poster session), Baltimore, May.
Eisner, Jason M (1997). What constraints should OT allow? LSA Annual Meeting, Chicago, January.

Invited papers

Karakos, Damianos, Sanjeev Khudanpur, Jason Eisner, and Carey E. Priebe (2005). Unsupervised classification via decision trees: An information-theoretic perspective. Proceedings of the 2005 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 1081-1084, Philadelphia, March. Invited talk.

Technical reports

Cui, Jia and Jason Eisner (2006). Finite-state Dirichlet allocation: Learned priors on finite-state models.. Technical Report 53, Center for Language and Speech Processing, Johns Hopkins University, April.
Hajic, Jan, et al. (2004). Natural language generation in the context of machine translation. Technical report, Center for Language and Speech Processing, Johns Hopkins University, Baltimore, March. 87 pp.
Eisner, Jason (1997). State-of-the-Art Algorithms for Minimum Spanning Trees.. Ms. (to become TR), University of Pennsylvania, April. 78 pp.
Eisner, Jason M (1996). An empirical comparison of probability models for dependency grammar. Technical report IRCS-96-11, Institute for Research in Cognitive Science, Univ. of Pennsylvania. 18 pp.
Eisner, Jason M (1991). Indirect STV election: A voting system for South Africa. White paper, University of Cape Town, June. 16 pp.
Eisner, Jason M (1990). Dynamical-systems behavior in recurrent and non-recurrent connectionist nets. Undergraduate honors thesis, Harvard University, April. 57 pp.

Outreach (general audience)

Eisner, Jason (2000). The science of language: Computational linguistics. Imagine Magazine, Center for Talented Youth, Johns Hopkins University, Baltimore, March.
Eisner, Jason (1991). Cognitive science and the search for intelligence. Invited paper presented to the Socratic Society, University of Cape Town, South Africa. 24 pp.

Patents

Jeffrey C. Reynar, Fred Herz, Jason Eisner, Lyle Ungar (1996). A Lempel-Ziv data compression technique utilizing a dictionary pre-filled with frequent letter combinations, words and/or phrases. U.S. Patent #5,951,623 issued 9/14/1999.
Frederick Herz, Lyle Ungar, Jason M. Eisner (1996). System for the automatic determination of customized prices and promotions. Pending.
Frederick S. M. Herz, Jason M. Eisner, Lyle H. Ungar (1995). System for generation of object profiles for a system for customized electronic identification of desirable objects. U.S. Patent #5,835,087 issued 11/10/1998.
Frederick S. M. Herz, Jason M. Eisner, Lyle H. Ungar, Mitchell P. Marcus (1995). System for generation of user profiles for a system for customized electronic identification of desirable objects. U.S. Patent #5,754,939 issued 5/19/1998.
Frederick S. M. Herz, Jason Eisner, Marcos Salganicoff (1995). Pseudonymous server for system for customized electronic identification of desirable objects. U.S. Patent #5,754,938 issued 5/19/1998.

Teaching

7/2000-		Department of Computer Science, Johns Hopkins University
	Assistant Professor and Graduate Program Chair. Robert B. Pond, Sr. Excellence in Teaching Award (Whiting School of Engineering, 2005). Natural Language Processing (2001, 2002, 2003, 2004, 2006) A mixed graduate-undergraduate class that teaches a synthesis of statistical models, formal grammars, and linguistic theory, with associated algorithms. It is reputed to be one of the most challenging classes in the Computer Science department, requiring both rigor and intellectual flexibility. Faculty at several other universities have asked to use the extensive online course materials. Enrollment: about 30. Declarative Methods (2005, 2006) A new course for juniors, seniors, and graduate students. It surveys computational problems that tend to pop up frequently in different guises (e.g., constraint satisfaction); the specification languages used to describe instances of these problems; general toolkits for solving these instances; and the algorithms run by these toolkits. Enrollment: about 35. Seminar in Natural Language Processing (ongoing) A weekly reading and discussion group, exploring important current research in natural language processing and potentially relevant material from related fields. Topics are chosen by the group; each lasts 3-4 weeks. Attendance: up to 10 (not all enrolled). Totally Random (2004, 2005) A 4-class discussion unit about random numbers and the uses of randomness in computer science. Part of the department's new freshman experience course. Enrollment: 8-10. Data Structures (2003, 2004) A sophomore-level class, the third and last in the programming sequence for majors. Covers basic data structures and algorithms, basic analysis of algorithms, and object-oriented programming style. Online "warmups" and highly interactive classes stimulated the students to come up with designs and variations. The challenging weekly assignments often used real-world data. Faculty at a dozen other universities have asked to use the course materials. Enrollment: about 50. Finite-State Methods in Natural Language Processing (2000-2001) A graduate class on semiring-weighted finite-state transducers. Covers theory and practice, including the theory of formal power series, the extended regular expression calculus, and a range of applications to natural language. Rigorous assignments. Attendance: about 20 (mostly not enrolled). Statistical Language Learning (2002) A graduate class about past and present research that has attempted, with mixed success, to induce the structure of language from raw data such as text. Lectures are intermixed with reading and discussion of the primary literature. Attendance: about 10 (mostly not enrolled).
2002-		Lecturer, NAACL Summer School in Human Language Technology
1/2000-6/2001		Department of Computer Science, University of Rochester
	Assistant Professor. Statistical Learning of Natural Language (2000) (see Statistical Language Learning, above) Graduate Problem Seminar (2000) Boot camp for new Ph.D. students. Students learn research skills by teaming up to tackle a series of open-ended engineering problems that touch on research in the department. (I made them build systems for face orientation detection, distributed calendar management, and information retrieval.) Several written and oral presentations are required and receive extensive feedback. The class also includes career advice, familiarization with departmental resources, presentations by other faculty, and a final research project. Enrollment: 10.
1994-95		Department of Computer Science, University of Pennsylvania
	TA in Introduction to Programming. Graduate Teaching Award.

Advising

Ph.D. students

Jason Smith (2006-)
Omar Zaidan (2005-)
John Blatz (2004-)
Eric Goldlust (2004-) (Wolman Fellow; Muuss Research Award; Hon. Mention for CRA Outstanding Undergraduate Award)
Markus Dreyer (2003-) (Wolman Fellow)
David A. Smith (2002-) (NSF Fellow)
Roy Tromble (2002-) (NSDEG Fellow)
Noah A. Smith (2001-2006) (Hertz Foundation Fellow; now Asst. Prof., CMU)

B.S/M.S.E. research students

Asheesh Laroia (2006-)
Samuel Huang (2006-) (Pistritto Fellow)
Constantinos Michael (2005-)
George Shafer (2005-2006)
John Graettinger (2005-2006) (Outstanding Research Award)
Michael Kornbluh (2004-2005) (Pistritto Fellow, Outstanding Senior Award)
Chalaporn Hathaidharm (2002-2004)

Ph.D. thesis committees

Gaja Jarosz Snover (2006)
Jonathan Allen (2006)
Gideon Mann (2006)
Charles Schafer (2006)
Myroslava Dzikovska (2004, Univ. of Rochester)
Silviu Cucerzan (2003)
Radu "Hans" Florian (2002)
Jun Wu (2002)
Richard Wicentowski (2002)
Grace Ngai (2000)

Last Modification $Date: 2006/10/19 18:59:31 $ (GMT)

JASON M. EISNER Curriculum Vitae (PDF)