Sfy NLP

Sfy

Currently, I am trying to streamline the natural language processing done by CASSIE, a SNePS reasoning agent. Building off bits by David Pierce, I am working to fuse LKB with SNePS. Following Pierce's lead, this project goes by the handle Sfy (which I pronounce as a rhyme with `by').

In the sketch below, I use filled circles to denote working bits of code. The squares show my current focus.

Algorithm Outline

• Verify that all the words exist
  • Check WordNET for unknown words
  • Make templates from dummy words for the rest
• Parse the sentence(s)
• For every parse, extract the scope(s)
• Cross-check any individuals with the network
• Create a SNePS representation from the MRS
• Rank the parses according to expectations of:
  • Prior knowledge
  • Discourse model
  • Probable genre/construction of utterance
• Update discourse model and world knowledge

Documentation and Presentations:

Integrating Syntactic and Semantic Tools in Sfy: A Case Study in Lexical Acquisition (with a presentation)

On March 26, 2008, I presented a paper at the CSE GSA Grad Conference on two approaches within Sfy for acquiring unknown lexical items.

Reference Resolution Overview

On March 7, 2008, I outlined some of the essential background on reference resolution as a precursor to integrating it into Sfy. The talk focused on aspects of the literature that were most relevant to Sfy and SNePS as opposed to that which was most important to the field. Sfy Overview

On November 2, 2007, I gave a talk before SNeRG. Much of background discussion was gleaned from the following sources:

• Implementing Typed Feature Structure Grammars by Ann Copestake
• Minimal Recursion Semantics: An Introduction by Ann Copestake, et al. (this should not be confused with the 1999 draft of the same name)
• MRS and SNePS: A Comparison by Stuart C. Shapiro

For the sake of posterity, this work is an attempt to replace the original GATN grammars implemented before my time at UB. The primary sources for that research include:

• Transition Network Grammars for Natural Language Analysis by W.A. Woods
• Generalized Augmented Transition Network Grammars for Generation from Semantic Networks by Stuart C. Shapiro (also not to be confused with the 1979 version)

Other random sources are as follows:

• Construction and Analysis of an LKB Grammar by Chris Becker

I'll try to keep my bibliography up-to-date.

Downloading a local copy

Elements External to UB

LKB

ERG

HPSG