[Prev][Next][Index]
Meeting, Thursday, Oct 9th
-
To: srini@linc.cis.upenn.edu, beth@linc.cis.upenn.edu, cdoran@linc.cis.upenn.edu, mpalmer@linc.cis.upenn.edu, joshi@linc.cis.upenn.edu, anoop@linc.cis.upenn.edu, skulick@linc.cis.upenn.edu, mickeyc@linc.cis.upenn.edu, bhatt@linc.cis.upenn.edu, josephr@linc.cis.upenn.edu, siegel@BABEL.ling.upenn.edu, kipper@gradient.cis.upenn.edu, vijay@udel.edu, schuler@gradient.cis.upenn.edu, izvorski@BABEL.ling.upenn.edu, spc@gradient.cis.upenn.edu, park@linc.cis.upenn.edu, heatherm@unagi.cis.upenn.edu, prolo@gradient.cis.upenn.edu, fxia@gradient.cis.upenn.edu, ak261@is6.nyu.edu, merlo@linc.cis.upenn.edu, jmacdoug@central.cis.upenn.edu, cote@linc.cis.upenn.edu, tsmorton@gradient.cis.upenn.edu, phopely@linc.cis.upenn.edu (Philip D Hopely), cparkes@linc.cis.upenn.edu (Cornelia Parkes)
-
Subject: Meeting, Thursday, Oct 9th
-
From: Christy Doran <cdoran@linc.cis.upenn.edu>
-
Date: Wed, 8 Oct 1997 09:57:14 -0400 (EDT)
When: 10:30 am, Oct 9th
Where: IRCS 402
What: William will be talking about his work on faster parsing
algorithms for TAGs, based on James Rogers' concept of 'regular form'
grammars which can be recognized in worst-case cubic time. The
impetus for this project has been the need for a real-time information
extraction system for Cogentex that is faster than the full n6 XTAG
parser, but more complete than the Lightweight Dependency Analyzer
(both in terms of complete trees and complete parse forests).