Jason R. Smith

Contact Info:


Email:
Office: New Engineering Building 329

I am a second year PhD student at Johns Hopkins University in Computer Science. I am also a member of the Center for Language and Speech Processing, and an advisee of Jason Eisner.

Research Interests

As a masters student at Louisiana Tech University under my previous advisor, Andrei Paun, I was focused mostly on finite automata. Now I am interested in areas in natural language processing which include the application of finite automata, as well as those that do not. I was also a member of the ELERFED team in the CLSP Worksop 2007, and am interested in methods of extracting knowledge from Wikipedia.

Publications

Journal Publications:

  • C. Campeanu, A. Paun, J.R. Smith, Incremental construction of minimal deterministic finite cover automata. Theoretical Computer Science, 363(2), 2006, 135-148.

    Conference Publications:

  • Y. Versley, S. Ponzetto, M. Poesio, V. Eidelman, A. Jern, J. Smith, X. Yang, A.Moschitti, BART: A Modular Toolkit for Coreference Resolution. Companion Volume of the Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics, June 16-18 June, 2008.

  • Y. Versley, S. Ponzetto, M. Poesio, V. Eidelman, A. Jern, J. Smith, X. Yang, A.Moschitti, BART: A Modular Toolkit for Coreference Resolution. Proc. of the 6th International Conference on Language Resources and Evaluation, May 28-30, 2008, Marrakech, Morocco.

  • C. Campeanu, A. Paun, J. R. Smith, Tight Bounds for the State Complexity of Deterministic Cover Automata, Proc. of Descriptional Complexity of Formal Systems, 8th Workshop, June 21-23, 2006, Las Cruces, New Mexico, USA.

  • C. Campeanu, A. Paun, J.R. Smith, An Incremental Algorithm for Minimal Deterministic Finite Cover Automata, Proc. of Tenth International Conference on Implementation and Application of Automata (CIAA05), June 27-29, 2005, Sophia Antipolis, France.