-
- Me and V.
Scott Martin
- scott [at] ling [dot] osu [dot] edu
- My public key
- mailing address
- 24b Oxley Hall
1712 Neil Avenue
Columbus, OH 43210 - phone
- 614-292-8878
About Me
I am a Ph. D. student in linguistics. My general academic interests include computational, mathematical, and theoretical linguistics, focusing on the intersection of logic, language, and information. You can also find photos, my software engineering portfolio, and other stuff about me over at coffeeblack.
My theoretical work mostly focuses on developing Convergent Grammar (CVG), a logical framework for describing the phonology/syntax/semantics/pragmatics interface, with Carl Pollard and others. I also work with Michael White on OpenCCG (an open-source parser and realizer for CCG).
Publications
In Proceedings
- Scott Martin, Rajakrishnan Rajkumar and Michael White. Grammar Engineering for CCG using Ant and XSLT. In
Proceedings of the Workshop on Software Engineering,
Testing, and Quality Assurance for Natural Language Processing
(SETQA-NLP), 2009.
- Scott Martin. A Proof-theoretic Approach to French Pronominal
Clitics.
In Kata Balogh, editor, Proceedings of the Thirteenth ESSLLI Student Session, May 2008.
- D.J. Hovermale and Scott Martin. Developing an Annotation Scheme for
ELL Spelling Errors. In
Proceedings of the Fifth Midwest Computational
Linguistics Colloquium, 2008.
- Michael White, Rajakrishnan Rajkumar and Scott Martin. Towards Broad Coverage Surface Realization with
CCG. In
Proceedings of the Workshop on Using Corpora for NLG: Language
Generation and Machine Translation (UCNLG+MT), 2007.
Software
Pep
The name Pep stands for Pep is an Earley Parser and is an example of direct left recursion. Pep is an implementation of Earley's chart-parsing algorithm in Java. It includes a thin command-line interface, but is intended to be used as a library. Pep is free software, released under the GNU Lesser General Public License.
- Pep source and binaries
- Pep version 0.4
- Signature
- My public key
The tar bundle above contains Pep's binaries, full source code, generated documentation, and an Ant build file. It also includes several sample grammars for testing and automated JUnit tests.
Pep can parse strings specified by any CFG (including those that contain recursive rules). Version 0.4 is generalized to allow rules with right-hand sides that include a mix of terminals and nonterminals. Pep's charts use backpointers so that if a grammar allows ambiguity, Pep keeps track of all of the possible parses in a set of iterable parse trees.
Funnel
Google's recently-released Web 1T 5-gram Corpus contains so much data that many machines with average amounts of memory are unable to even load it. Funnel is a tool for filtering enormous LMs down to a more manageable size based on user-defineable criteria, such as a limited vocabulary.
- Funnel source and binaries
- Funnel version 0.1
- Signature
- My public key
Custom filters can be specified by implementing a very simple interface with one method. Filters can also be chained in series, so the effects of one can be made to cascade to others. Funnel works with single-file count LMs as well as with the Google multiple-file format.
Talks
Enriching Contexts for Type-Theoretic Dynamics
Invited talk with Carl Pollard. Presented at the CAuLD workshop on Logical Methods for Discourse, December 14, 2009.
Using Semantic Dependencies to Improve Paraphrase Alignment
My second qualifying paper. Presented in Clippers, November 6, 2009.
A Proof-theoretic Approach to FPCs
Presentation of my ESSLLI 2008 paper. 13th ESSLLI Student Session. Hamburg, Germany, August 7, 2008.
Subversion Tutorial
A basic introduction to using Subversion. Part of the LCC tutorial series. May 14, 2007.
AJAX Overview
Brief discussion of the AJAX web development technique. Given in Clippers, January 19, 2007.
- PDF Slides
- Source code
- A simple example implementation.
Teaching
Linguistics 680: Formal Foundations
Graduate foundational course on the mathematical tools used in linguistic theory.
Linguistics 201: Introduction to Language
Broad-based introduction to linguistics. Course description.
Linguistics 384: Language and Computers
Undergraduate-level introduction to computational linguistics. Course description.