|Runtime "learning" email@example.com (Doru-Catalin Togea) (2001-10-27)|
|RE: Runtime "learning" firstname.lastname@example.org (Quinn Tyler Jackson) (2001-10-28)|
|Re: Runtime "learning" email@example.com (2001-11-05)|
|From:||"Quinn Tyler Jackson" <firstname.lastname@example.org>|
|Date:||28 Oct 2001 13:55:58 -0500|
|Posted-Date:||28 Oct 2001 13:55:58 EST|
> However, I would like to build a parser which learns the grammar of
> the IDL-like language at runtime. In other words, I want it to read
> some templates of some kind, and then recognize sentences conforming
> to the language described in those templates. In this way, when
> updating the language, the parser doesn't need to be compiled again.
A few links that might get you started:
http://sequence.rutgers.edu/~nevill/ (Projects - Sequitur)
The above two examples are not template, but instance based.
On the theoretical end, some of the literature on adaptive grammar cited here:
(In particular, the work of Christiansen, Burshteyn, Boullier, and Shutt.)
An upcoming paper (Jackson & Langan - "Adaptive Predicates in
Empty-Start Natural Language Parsing") covers some of the issues of
template based modification, but in the context of NLP. Abstract: "We
examine the usefulness of the §-Calculus as a formalism for natural
language parsing, and in particular the power of a single adaptive
predicate in a structure-only English grammar in providing document
wide context resolution. We were able to construct an §-grammar for a
limited subset of English that a) contained no English words at start,
and b) correctly parsed a series of twenty-two sentences without the
use of any mechanism outside the formalism of the §-grammar itself."
Very few out-of-the-box parsers can modify the grammar proper on the
fly in the way you're describing. (For a very small value for "very
few.") A commercial-scale PG that allows just that is "coming soon"
however. (Implemented - not fully documented.)
Quinn Tyler Jackson
Return to the
Search the comp.compilers archives again.