[cmp-lg/9604008v1] Efficient Algorithms for Parsing the DOP Model
Excellent results have been reported for Data-Oriented Parsing (DOP) of natural language texts (Bod, 1993). Unfortunately, existing algorithms are both computationally intensive and difficult to implement. Previous algorithms are expensive due to two factors: the exponential number of rules that must be generated and the use of a Monte Carlo parsing algorithm. In this paper we solve the first
[cmp-lg/9604008] Efficient Algorithms for Parsing the DOP Model - arXiv.org
Efficient Algorithms for Parsing the DOP Model Joshua Goodman (Harvard University) Excellent results have been reported for Data-Oriented Parsing (DOP) of natural language texts (Bod, 1993). Unfortunately, existing algorithms are both computationally intensive and difficult to implement.
Efficient Algorithms for Parsing the DOP Model - ACL Anthology
Efficient Algorithms for Parsing the DOP Model. In Conference on Empirical Methods in Natural Language Processing. Cite (Informal): Efficient Algorithms for Parsing the DOP Model (Goodman, EMNLP 1996) Copy Citation: BibTeX Markdown More options… PDF: https://aclanthology.org/W96-0214.pdf
Efficient Algorithms for Parsing the DOP Model - ACL Anthology
Figure 2: Sample STSG Produced from DOP Model Khalil Sima'an (1996) implemented a version of the DOP model, which parses efficiently by lim- iting the number of trees used and by using an efficient most probable derivation model. His ex- periments differed from ours and Bod's in many
[cmp-lg/9605031] Efficient Algorithms for Parsing the DOP Model? A
This note is a reply to Joshua Goodman's paper "Efficient Algorithms for Parsing the DOP Model" (Goodman, 1996; cmp-lg/9604008). In his paper, Goodman makes a number of claims about (my work on) the Data-Oriented Parsing model (Bod, 1992-1996). This note shows that some of these claims must be mistaken.
