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³) 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.

Citations

1043	Head-Driven Phrase Structure Grammar. The University of Chicago - Pollard, Sag - 1994
1011	A note on two problems in connexion with graphs. Numerische Mathematik 1: 269–271 - Dijkstra - 1959
649	A stochastic parts program and noun phrase parser for unrestricted text - Church - 1988
594	An efficient context-free parsing algorithm - Earley - 1970
427	Three Generative, Lexicalised Models for Statistical Parsing - Collins - 1997
396	New Statistical Parser Based on Bigram Lexical De-pendencies - Collins - 2006
377	Two-level morphology: a general computational model for word-form recognition and production - Koskenniemi - 1983
324	Statistical Parsing with a Context-Free Grammar and Word Statistics - Charniak - 1997
313	Parsing english with a link grammar - Sleator, Temperley - 1993
296	Dependency Syntax: Theory and Practice - Melcuk - 1988
290	Regular models of phonological rule systems - Kaplan, Kay - 1994
209	Selection and Information: A ClassBased Approach to Lexical Relationships - Resnik - 1993
200	Three New Probabilistic Models for Dependency Parsing: An Exploration - Eisner - 1996
155	An e cient probabilistic context-free parsing algorithm that computes pre x probabilities - Stolcke - 1995
122	The convergence of mildly context-sensitive grammatical formalisms - Joshi, Vijay-Shanker, et al. - 1991
120	Algorithm schemata and data structures in syntactic processing - Kay - 1980
111	Parsing strategies with lexicalized grammars: application to tree adjoining grammar - Schabes, Abeille, et al. - 1988
102	Dependency Systems and Phrase-Structure Systems - Gaifman - 1965
79	Grammatical trigrams: a probabilistic model of link grammar - Lafferty, Sleator, et al. - 1992
76	An improved context-free recognizer - Graham, Harrison, et al. - 1980
74	Efficent Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars - Eisner, Satta - 1999
65	New figures of merit for best first probabilistic chart parsing - Caraballo, Charniak - 1997
65	Parsing Inside-Out - Goodman - 1998
63	Weighted automata in text and speech processing - Mohri, Pereira, et al. - 1996
55	On the complexity analysis of static analyses - McAllester
42	Bilexical Grammars and a CubicTime Probabilistic Parser - Eisner - 1997
42	Dynamic Dependency Grammar - Milward - 1994
40	Head Automata and Bilingual Tiling: Translation with Minimal Representations - Alshawi - 1996
40	The Phrasal Lexicon - Becker - 1975
37	An empirical comparison of probability models for dependency grammar - Eisner - 1996
35	Probabilistic Feature Grammars - Goodman - 1997
8	Dependency Syntax: Theory and Practice - cuk, Igor - 1988
6	A faster parsing algorithm for lexicalized tree-adjoining grammars - Eisner, Satta - 2000
5	A.: Augmented Transition Networks for Natural Language Analysis - Woods