Efficient Algorithms for Parsing the DOP Model? A Reply to Joshua Goodman

1996/05/24 by Rens Bod, Bod, Rens · 1 voice · 1 citation
Computer Science · #Algorithms and Data Compression #Computation and Language (cs.CL) #Constraint Satisfaction and Optimization #FOS: Computer and information sciences #Natural Language Processing Techniques #cs.CL

paper · pdf · doi:10.48550/arxiv.cmp-lg/9605031

openalex publication_date 1996/05/24 · arxiv published 1996/05/24 · arxiv updated 1996/05/24 · openalex created_date 2025/10/24 · openalex updated_date 2026/07/28

Abstract

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.

Cited by

• Data-Oriented Language Processing. An Overview

Discussions

• Then Rens Bod answered through a squib in the CL journal arxiv.org/abs/cmp-lg/9... [bsky, 2 points, 0 comments]

Related

• Aspects of Pattern-Matching in Data-Oriented Parsing
• Learning Efficient Disambiguation
• Two Questions about Data-Oriented Parsing
• A Fundamental Algorithm for Dependency Parsing (With Corrections)
• Automating the Analysis of Parsing Algorithms (and other Dynamic Programs)