Gibbsian Context-Free Grammar for Parsing

Authors:
Antoine Rozenknop
Affiliations:
-
Venue:
TSD '02 Proceedings of the 5th International Conference on Text, Speech and Dialogue
Year:
2002

Citing 4
Cited 0

An efficient probabilistic context-free parsing algorithm that computes prefix probabilities

Computational Linguistics
Inducing Features of Random Fields

IEEE Transactions on Pattern Analysis and Machine Intelligence
Parsing inside-out

Parsing inside-out
PCFG models of linguistic tree representations

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Probabilistic Context-Free Grammars can be used for speech recognition or syntactic analysis thanks to especially efficient algorithms. In this paper, we propose an instantiation of such a grammar, which mathematical properties are intuitively more suitable for those tasks than SCFG's (Stochastic CFG), without requiring specific analysis algorithms. Results on the Susanne text show that up to 33% of analysis errors made by a SCFG can be avoided with this model.