Recent work on parsing with probabilistic CFGs ?

Thread View: comp.theory

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Andreas Eisele Tue, 26 Jan 1993 04:22

#1862

Author: Andreas Eisele
Date: Tue, 26 Jan 1993 04:22

20 lines
1587 bytes

I am looking for recent papers on that topic. I know the papers by
Wright, Wrigley & Sharman and by Ng & Tomita in the IWPT 91
proceedings, but nothing that has been done or published since.

In particular, I'm wondering if anyone has tried to come up with a
probabilistic version of a parser for general CFG in the style of
Earley 70,  and Graham, Harrison & Ruzzo 80. If you have tried and
have encountered results or unexpected difficulties, I would be very
interested in knowing about them.

Thank you very much in advance for any information

Andreas Eisele
--
+--------------------------------------------------------------------------+
|Andreas Eisele          Inst. f. Logik, Komplexitaet u. Deduktionssysteme |
|Tel.:    +49-721-608-4734     Universitaet Karlsruhe, Am Fasanengarten 5  |
|Fax.:    +49-721-60 77 21   D-7500 Karlsruhe 1,  Fed. Rep. of Germany     |
|email:   andreas@ims.uni-stuttgart.de, eisele@ira.uka.de    (NeXTMail ok) |
+--------------------------------------------------------------------------+

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads