Abstract
This chapter introduces weighted bilexical grammars, a formalism in which individual lexical items, such as verbs and their arguments, can have idiosyncratic selectional influences on each other. Such ‘bilexicalism’ has been a theme of much current work in parsing. The new formalism can be used to describe bilexical approaches to both dependency and phrase-structure grammars, and a slight modification yields link grammars. Its scoring approach is compatible with a wide variety of probability models.
The obvious parsing algorithm for bilexical grammars (used by most previous authors) takes time O(n 5). A more efficient O(n 3) method is exhibited. The new algorithm has been implemented and used in a large parsing experiment Eisner, 1996b). We also give a useful extension to the case where the parser must undo a stochastic transduction that has altered the input.
This material is based on work supported by an NSF Graduate Research Fellowship and ARPA Grant N6600194-C-6043 ‘Human Language Technology’ to the University of Pennsylvania.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alshawi, H. (1996). Head automata and bilingual tiling: Translation with minimal representations. In Proceedings of the 34th ACL, pp. 167–176, Santa Cruz, CA.
Becker, J. D. (1975). The phrasal lexicon. Report 3081 (AI Report No. 28), Bolt, Beranek, and Newman.
Caraballo, S. A. and Charniak, E. (1998). New figures of merit for best-first probabilistic chart parsing. Computational Linguistics.
Charniak, E. (1995). Parsing with context-free grammars and word statistics. Technical Report CS-95–28, Department of Computer Science, Brown University, Providence, RI.
Charniak, E. (1997). Statistical parsing with a context-free grammar and word statistics. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 598–603, Menlo Park. AAAI Press/MIT Press.
Church, K. W. (1988). A stochastic parts program and noun phrase parser for unrestricted text. In Proceedings of the 2nd Conf. on Applied NLP, pp. 136–148, Austin, TX.
Collins, M. J. (1996). A new statistical parser based on bigram lexical dependencies. In Proceedings of the 34th ACL, pp. 184–191, Santa Cruz, July.
Collins, M. J. (1997). Three generative, lexicalised models for statistical parsing. In Proceedings of the 35th ACL and 8th European ACL, pp. 16–23, Madrid, July.
Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271.
Earley, J. (1970). An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94–102.
Eisner, J. (1996a). An empirical comparison of probability models for dependency grammar. Technical Report IRCS-96–11, Institute for Research in Cognitive Science, Univ. of Pennsylvania.
Eisner, J. (1996b). Three new probabilistic models for dependency parsing: An exploration. In Proceedings of the 16th International Conference on Computational Linguistics (COLING-96), pp. 340–345, Copenhagen.
Eisner, J. (1997). Bilexical grammars and a cubic-time probabilistic parser. In Proceedings of the Fifth International Workshop on Parsing Technologies, pp. 54–65, MIT, Cambridge, MA.
Eisner, J. and Satta, G. (1999). Efficient parsing for bilexical context-free grammars and head-automaton grammars. In Proceedings of the 37th ACL, pp. 457–464, University of Maryland.
Eisner, J. and Satta, G. (2000). A faster parsing algorithm for lexicalized tree-adjoining grammars. In Proceedings of the 5th Workshop on Tree-Adjoining Grammars and Related Formalisms (TAG+5), Paris.
Gaifman, H. (1965). Dependency systems and phrase structure systems. Information and Control, 8:304–337.
Goodman, J. (1997). Probabilistic feature grammars. In Proceedings of the 1997 International Workshop on Parsing Technologies, pp. 89–100, MIT, Cambridge, MA.
Goodman, J. (1998). Parsing Inside-Out. PhD thesis, Harvard University.
Graham, S. L., Harrison, M. A., and Ruzzo, W. L. (1980). An improved context-free recognizer. ACM Transactions on Programming Languages and Systems, 2(3):415–463.
Joshi, A. K., Vijay-Shanker, K., and Weir, D. (1991). The convergence of mildly context-sensitive grammar formalisms. In Sells, P., Shieber, S. M., and Wasow, T., editors, Foundational Issues in Naural Language Processing, chapter 2, pp. 31–81. MIT Press.
Kaplan, R. M. and Kay, M. (1994). Regular models of phonological rule systems. Computational Linguistics, 20(3):331–378.
Kay, M. (1986). Algorithm schemata and data structures in syntactic processing. In Grosz, B. J., Sparck Jones, K., and Webber, B. L., editors, Natural Language Processing, pp. 35–70. Kaufmann, Los Altos, CA.
Koskenniemi, K. (1983). Two-level morphology: A general computational model for word-form recognition and production. Publication 11, Department of General Linguistics, University of Helsinki.
Lafferty, J., Sleator, D., and Temperley, D. (1992). Grammatical trigrams: A probabilistic model of link grammar. In Proceedings of the AAAI Fall Symposium on Probabilistic Approaches to Natural Language, pp. 89–97, Cambridge, MA.
McAllester, D. (1999). On the complexity analysis of static analyses. In Proceedings of the 6th International Static Analysis Symposium, Venezia, Italy.
Mel’čuk, I. (1988). Dependency Syntax: Theory and Practice. State University of New York Press.
Milward, D. (1994). Dynamic dependency grammar. Linguistics and Philosophy, 17:561–605.
Mohri, M., Pereira, F., and Riley, M. (1996). Weighted automata in text and speech processing. In Workshop on Extended Finite-State Models of Language (ECAI-96), pp. 46–50, Budapest.
Pollard, C. and Sag, I. A. (1994). Head-Driven Phrase Structure Grammar. University of Chicago Press and Stanford: CSLI Publications, Chicago.
Resnik, P. (1993). Selection and Information: A Class-Bayed Approach to Lexical Relationships. PhD thesis, University of Pennsylvania. Technical Report IRCS-93–42, November.
Schabes, Y., Abeille, A., and Joshi, A. (1988). Parsing strategies with ‘lexical-ized’ grammars: Application to Tree Adjoining Grammars. In Proceedings of COLING-88, pp. 578–583, Budapest.
Sleator, D. and Temperley, D. (1993). Parsing English with a link grammar. In Proceedings of the 3rd International Workshop on Parsing Technologies, pp. 277–291.
Stolcke, A. (1995). An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2): 165–201.
Woods, W. A. (1969). Augmented transition networks for natural language analysis. Report CS-1, Harvard Computation Laboratory, Harvard University, Cambridge, MA.
Wu, D. (1995). An algorithm for simultaneously bracketing parallel texts by aligning words. In Proceedings of the 33rd ACL, pp. 244–251, MIT.
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
Eisner, J. (2000). Bilexical Grammars and their Cubic-Time Parsing Algorithms. 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_3
Download citation
DOI: https://doi.org/10.1007/978-94-015-9470-7_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5579-8
Online ISBN: 978-94-015-9470-7
eBook Packages: Springer Book Archive