Abstract
We present a new formalism, probabilistic feature grammar (PFG). PFGs combine most of the best properties of several other formalisms, including those of Collins, Magerman, and Charniak, and in experiments have comparable or better performance. PFGs generate features one at a time, probabilistically, conditioning the probabilities of each feature on other features in a local context. Because the conditioning is local, efficient polynomial time parsing algorithms exist for computing inside, outside, and Viterbi parses. PFGs can produce probabilities of strings, making them potentially useful for language modeling. Precision and recall results are comparable to the state of the art with words, and the best reported without words.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abney, S. (1996). Stochastic attribute-value grammars. Available as cmp-lg/9610003.
Baker, J. K. (1979). Trainable grammars for speech recognition. In Proceedings of the Spring Conference of the Acoustical Society of America, pp. 547–550, Boston, MA.
Black, E., Garside, G., and Leech, G. (1993). Statistically-Driven Computer Grammars of English: the IBM/Lancaster Approach, volume 8 of Language and Computers: Studies in Practical Linguistics. Rodopi, Amsterdam.
Black, E., Jelinek, F., Lafferty, J., Magerman, D. M., Mercer, R., and Roukos, S. (1992a). Towards history-based grammars: Using richer models for probabilistic parsing. In Proceedings of the February 1992 DARPA Speech and Natural Language Workshop.
Black, E., Lafferty, J., and Roukos, S. (1992b). Development and evaluation of a broad-coverage probabilistic grammar of English-language computer manuals. In Proceedings of the 30th Annual Meeting of the ACL, pp. 185–192.
Brew, C. (1995). Stochastic HPSG. In Proceedings of the Seventh Conference of the European Chapter of the ACL, pp. 83–89, Dublin, Ireland.
Briscoe, T. and Carroll, J. (1993). Generalized probabilistic LR parsing of natural language (corpora) with unification-based grammars. Computational Linguistics, 19:25–59.
Carroll, J. and Briscoe, T. (1992). Probabilistic normalisation and unpacking of packed parse forests for unification-based grammars. In Proceedings of the AAAI Fall Symposium on Probabilistic Approaches to Natural Language, pp. 33–38, Cambridge, MA.
Charniak, E. (1996). Tree-bank grammars. Technical Report CS-96–02, Department of Computer Science, Brown University. Available from ftp://ftp.cs.brown.edu/pub/techreports/96/cs96–02.ps.Z.
Charniak, E. (1997). Statistical parsing with a context-free grammar and word statistics. In Proceedings of the AAAI, pp. 598–603, Providence, RI. AAAI Press/MIT Press.
Collins, M. (1996). A new statistical parser based on bigram lexical dependencies. In Proceedings of the 34th Annual Meeting of the ACL, pp. 184–191, Santa Cruz, CA. Available as cmp-lg/9605012.
Collins, M. (1997). Three generative, lexicalised models for statistical parsing. In Proceedings of the 35th Annual Meeting of the ACL, pp. 16–23, Madrid, Spain. Available as cmp-lg/9706022.
Eisele, A. (1994). Towards probabilistic extensions of constraint-based grammars. DYANA-2 Deliverable R1.2.B. Available from ftp://ftp.ims.uni-stuttgart.de/papers/DYANA2/R1.2.B.
Goodman, J. (1996). Parsing algorithms and metrics. In Proceedings of the 34th Annual Meeting of the ACL, pp. 177–183, Santa Cruz, CA. Available as cmp-lg/9605036.
Goodman, J. (1997). Global thresholding and multiple-pass parsing. In Proceedings of the Second Conference on Empirical Methods in Natural Language Processing, pp. 11–25.
Goodman, J. (1998). Parsing Inside-Out. PhD thesis, Harvard University. Available as cmp-lg/9805007 and from http://www.research.microsoft.com/~joshuago/thesis.ps.
Lari, K. and Young, S. (1990). The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 4:35–56.
Magerman, D. (1994). Natural Language Parsing as Statistical Pattern Recognition. PhD thesis, Stanford University University. Available as cmp-lg/9405009.
Magerman, D. (1995). Statistical decision-models for parsing. In Proceedings of the 33rd Annual Meeting of the ACL, pp. 276–283, Cambridge, MA.
Miller, S., Stallard, D., Bobrow, R., and Schwartz, R. (1996). A fully statistical approach to natural language interfaces. In Proceedings of the 34th Annual Meeting of the ACL, pp. 55–61, Santa Cruz, CA.
Ratnaparkhi, A. (1997). A linear observed time statistical parser based on maximum entropy models. In Proceedings of the Second Conference on Empirical Methods in Natural Language Processing, pp. 1–10.
Stolcke, A. (1993). An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Technical Report TR-93–065, International Computer Science Institute, Berkeley, CA. Available as cmp-lg/9411029.
Zavaliagkos, G., Anastasakos, T., Chou, G., Lapre, C., Kubala, F., Makhoul, J., Nguyen, L., Schwartz, R., and Zhao, Y. (1994). Improved search, acoustic and language modeling in the BBN Byblos large vocabulary CSR system. In Proceedings of the ARPA Workshop on Spoken Language Technology, pp. 81–88, Plainsboro, New Jersey.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Goodman, J. (2000). Probabilistic Feature Grammars. In: Bunt, H., Nijholt, A. (eds) Advances in Probabilistic and Other Parsing Technologies. Text, Speech and Language Technology, vol 16. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9470-7_4
Download citation
DOI: https://doi.org/10.1007/978-94-015-9470-7_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5579-8
Online ISBN: 978-94-015-9470-7
eBook Packages: Springer Book Archive