A generative probability model for unification-based grammars

Authors:
Helmut Schmid
Affiliations:
University of Stuttgart, Stuttgart, Germany
Venue:
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Year:
2002

Citing 7
Cited 1

Natural language parsing as statistical pattern recognition

Natural language parsing as statistical pattern recognition
Stochastic attribute-value grammars

Computational Linguistics
Stochastic HPSG

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
The structure of shared forests in ambiguous parsing

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Estimators for stochastic "Unification-Based" grammars

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Lexicalization of probabilistic grammars

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Lexicalized stochastic modeling of constraint-based grammars using log-linear measures and EM training

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics

New advances in logic-based probabilistic modeling by PRISM

Probabilistic inductive logic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A generative probability model for unification-based grammars is presented in which rule probabilities depend on the feature structure of the expanded constituent. The presented model is the first model which requires no normalization and allows the application of dynamic programming algorithms for disambiguation (Viterbi) and training (Inside-Outside). Another advantage is the small number of parameters.