Path: utzoo!attcan!uunet!samsung!usc!snorkelwacker.mit.edu!bloom-beacon!eru!hagbard!sunic!mcsun!corton!irisa!irisa.fr!quiniou
From: quiniou@irisa.fr (Rene Quiniou)
Newsgroups: comp.lang.prolog
Subject: Re: Efficiency of DCGs and chart parsers
Keywords: natural language, DCG, grammar, chart parser
Message-ID: <1991Jan24.131916.3127@irisa.fr>
Date: 24 Jan 91 13:19:16 GMT
References: <8014@castle.ed.ac.uk>
Sender: news@irisa.fr
Reply-To: quiniou@irisa.fr
Organization: Irisa, Rennes(FR)
Lines: 22

In article <8014@castle.ed.ac.uk>, jmcn@castle.ed.ac.uk (J McNicol) writes:
| I'm attempting to make DCG parsing more efficient by using a chart,
| using (approximately) Pereira and Shieber's method.  However I find
| that my new parser takes at least twice as long as standard Prolog 
| since it has to do so much housekeeping.
| 
| It seems a shame to abandon it having got as far as a DCG-compatible 
| translator; does anyone have any comments about chart parsing and Prolog, 
| such as 'chart parsing can't be done efficiently enough in Prolog'?
| 


In New Generation Computing, 8 (1990) pp. 113-138, N.K. Simpkins and P. Hancox demonstrate a method called ``Word Incorporation'' which can improve chart parsing, as they state.

Perhaps this may help.

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
  QUINIOU Rene                  quiniou@irisa.fr
  INRIA / IRISA                         Phone : +33 99 36 20 00
 Campus Universitaire de Beaulieu       Fax :   99 38 38 32
 35042 RENNES CEDEX - FRANCE            Telex : UNIRISA 950 473F
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=