##
**Intricacies of Collins’ parsing model.**
*(English)*
Zbl 1234.68397

Summary: This article documents a large set of heretofore unpublished details Collins used in his parser, such that, along with M. Collins’ thesis [Head-driven statistical models for natural language parsing. Ph.D. thesis. University of Pennsylvania (1999)], this article contains all information necessary to duplicate Collins’ benchmark results. Indeed, these as-yet-unpublished details account for an 11% relative increase in error from an implementation including all details to a clean-room implementation of Collins’ model. We also show a cleaner and equally well-performing method for the handling of punctuation and conjunction and reveal certain other probabilistic oddities about Collins’ parser. We not only analyze the effect of the unpublished details, but also reanalyze the effect of certain well-known details, revealing that bilexical dependencies are barely used by the model and that head choice is not nearly as important to overall parsing performance as once thought. Finally, we perform experiments that show that the true discriminative power of lexicalization appears to lie in the fact that unlexicalized syntactic structures are generated conditioning on the headword and its part of speech.

### MSC:

68T50 | Natural language processing |

### Keywords:

Collins’ parsing model
PDF
BibTeX
XML
Cite

\textit{D. M. Bikel}, Comput. Linguist. 30, No. 4, 479--511 (2004; Zbl 1234.68397)

Full Text:
DOI

### References:

[1] | DOI: 10.1109/T-C.1973.223746 · Zbl 0252.68033 |

[2] | DOI: 10.1016/0885-2308(90)90022-X |

[3] | Marcus Mitchell P, Computational Linguistics 19 pp 313– (1993) |

[4] | DOI: 10.1109/18.87000 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.