Carlo Ghezzi and Dino Mandrioli. Incremental Parsing. ACM Transactions on Programming Languages and Systems, 1(1):58--70, 1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Ronnquist [16, 17] refer to the special case as left to right (LR) incrementality and to the general case, in which arbitrary changes are allowed, as full incrementality. The latter case has long been studied in interactive language based programming environments (for example, Ghezzi and Mandrioli [4, 5]) whereas the only previous such work that we are aware of in the context of natural language processing is Wir en and Ronnquist [15, 16, 17] The aim of this paper is to adapt and apply the notion of bounded incremental computation to naturallanguage processing. Specifically, the paper ....

Carlo Ghezzi and Dino Mandrioli. Incremental Parsing. ACM Transactions on Programming Languages and Systems, 1(1):58--70, 1979.

....2, it is clear that a new parse strategy is needed. 4 Incremental LR Parsing This section provides a brief overview of some of the incremental LR parsing algorithms that have been presented in the literature. The seminal work on incremental LR parsing was performed by Ghezzi and Mandrioli [3, 4]. The symmetric parser they present in [3] is limited to recognising grammars that are both LR(1) and RL(1) A more sophisticated incremental parser is presented in [4] that does not require a grammar to be RL(1) and that pioneered the use of a matching condition to support early termination and ....

....is needed. 4 Incremental LR Parsing This section provides a brief overview of some of the incremental LR parsing algorithms that have been presented in the literature. The seminal work on incremental LR parsing was performed by Ghezzi and Mandrioli [3, 4] The symmetric parser they present in [3] is limited to recognising grammars that are both LR(1) and RL(1) A more sophisticated incremental parser is presented in [4] that does not require a grammar to be RL(1) and that pioneered the use of a matching condition to support early termination and to retain regions of a tree that contain ....

C. Ghezzi and D. Mandrioli. Incremental parsing. ACM Transactions on Programming Languages and Systems, 1(1):58--79, July 1979.

....inputs that differ slightly from one another, making use of the old output in computing a new output rather than computing from scratch. The large number of works on incremental computation in recent years and their many applications [RR93] demonstrated by various incremental algorithms such as [GM79,JG82,RTD83,Yeh83,RP88,Van88,FMB90,AHR 90,RR94] and general incremental computation approaches such as [Ear76,Pai81,PK82,Pai84,HT86, CP89,PT89,FT90,Smi90,Smi91,YS91,SH91,Sun91,Hoo92,van92,Fie93] motivated us to look for the fundamentals of incremental computation and their role in efficient ....

....on the literature in incremental computation, which then motivated the approach in this thesis. 2.1 Incremental algorithm Our first class includes particular incremental algorithms designed for particular problems dealing with particular input changes. Examples include incremental parsing [GM79,JG82] incremental attribute evaluation [RTD83,Yeh83,YK88,LMOW88, Jon90] incremental data flow analysis [Zad84,RP88,Bur90,MR90,RR94] incremental circuit evaluation [AHR 90] and incremental constraint solving [Van88,FMB90] The study of dynamic graph algorithms, such as transitive closure ....

C. Ghezzi and D. Mandrioli. Incremental parsing. ACM Transactions on Programming Languages and Systems, 1(1):58--70, July 1979.

....be updated. We use parsing for capturing the structure of text documents. Incremental parsing brings efficiency to the structuring. 5. 1 Related work Themes connected to incremental parsing are present already in [Loc65, Lin70] Research on incremental parsing handles both LR parsing [Cel78, GM79, GM80, Weg80, JG82, AD83, DMM88, Lar90] and LL or recursive descent parsing [Kah79, Str82, SDB84, MPS90] We distinguish incremental parsing from incremental generation of parsers [Kos90, GHKT88] where a modification in the grammar leads to an incremental update of the parser. In the HST system ....

Carlo Ghezzi and Dino Mandrioli. Incremental parsing. ACM Transactions on Programming Languages and Systems, 1(1):58 -- 70, July 1979.

....has appeared in [34] Despite the relatively diverse categories discussed in [34] most of the work can be divided into three classes. The first class includes particular incremental algorithms designed for particular problems dealing with particular input changes. Examples are incremental parsing [15, 18], incremental attribute evaluation [36, 49] incremental data flow analysis [38] incremental circuit evaluation [2] incremental constraint solving [45, 13] etc. The study of dynamic graph algorithms, e.g. 50] can be viewed as falling into this class. Although efforts in this class are ....

C. Ghezzi and D. Mandrioli. Incremental parsing. ACM Transactions on Programming Languages and Systems, 1(1):58--70, July 1979.

....has appeared in [33] Despite the relatively diverse categories discussed in [33] most of the work can be divided into three classes. The first class includes particular incremental algorithms designed for particular problems dealing with particular input changes. Examples are incremental parsing [15, 18], incremental attribute evaluation [35, 48] incremental data flow analysis [37] incremental circuit evaluation [2] incremental constraint solving [44, 13] etc. The study of dynamic graph algorithms, e.g. 49] can be viewed as falling into this class. Although efforts in this class are ....

C. Ghezzi and D. Mandrioli. Incremental parsing. ACM Transactions on Programming Languages and Systems, 1(1):58--70, July 1979.

....has appeared in [28] Despite the relatively diverse categories discussed in [28] most of the work can be divided into three classes. The first class includes particular incremental algorithms that deal with particular input changes to particular problems. Examples are incremental parsing[14, 17], incremental attribute evaluation [31, 45, 18] incremental data flow analysis[34, 33] incremental circuit evaluation[2] incremental constraint solving[43, 12] etc. The study of dynamic algorithms, e.g. 46, 29, 11] can be viewed as falling into this class. Although efforts in this class are ....

C. Ghezzi and D. Mandrioli. Incremental parsing. ACM Transactions on Programming Languages and Systems, 1(1):58--70, July 1979.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC