Well, I try to do some ... I work on tabular techniques used to
execute stack machine, and their application to context-sensitive
parsing. I made a nice prototype that generates parsers for several
classes of grammars (Context-Free Grammars, Tree-Adjoining Grammars,
Definite Clause Grammars), several parsing techniques (LR, LL,
Left-corner and 3 others), and several control mechanism
(backtracking, tabulation). This prototype is not yet distributed.
There are a couple of paper describing it in the
bibliography.
I am interested in the structure and properties of Shared Forests that
allow a compact representation of parse tree sets.
I work mostly with
Eric de la Clergerie .
F. Barthélemy et E. Villemonte de la Clergerie,
Subsumption--Oriented Push--Down Automata
Th\`ese (1993)
F. Barthélemy,
Outils pour l'analyse syntaxique contextuelle
ICLP 94
F. Barthélemy, A Grammatical Approach to DCG parsing
WML 94
F. Barthélemy and F. Rouaix,
Abstract Data-Types and Operators: an Experiment in
Constraint-Based Parsing, workshop on ML and its
applications
COLING 94
F. Barthélemy and F. Rouaix, A Modular Architecture for
Constraint-Based Parsing (COLING means probably COmputational
LINGuistics, but it is not an ACL conference)