John T. Maxwell

Learn More
In learning their native language children develop a remarkable set of capabilities They acquire knowledge and skills that enable them to pro duce and comprehend an inde nite number of novel utterances and to make quite subtle judgments about certain of their properties The ma jor goal of psycholinguistic research is to devise an explanatory account of the(More)
We present a stochastic parsing system consisting of a Lexical-Functional Grammar (LFG), a constraint-based parser and a stochastic disambiguation model. We report on the results of applying this system to parsing the UPenn Wall Street Journal (WSJ) treebank. The model combines full and partial parsing techniques to reach full grammar coverage on unseen(More)
This paper reports some experiments that compare the accuracy and performance of two stochastic parsing systems. The currently popular Collins parser is a shallow parser whose output contains more detailed semanticallyrelevant information than other such parsers. The XLE parser is a deep-parsing system that couples a Lexical Functional Grammar to a(More)
Many modern grammatical formalisms divide the task of linguistic specification into a contextfree component of phrasal constraints and a separate component of attribute-value or functional constraints. Conventional methods for recognizing the strings of a language also divide into two parts so that they can exploit the different computational properties of(More)
Researchers at PARC were pioneers in developing finite-state methods for applications in computational linguistics, and one of the original motivations was to provide a coherent architecture for the integration of lower-level lexical processing with higher-level syntactic analysis (Kaplan and Kay, 1981; Karttunen et al., 1992; Kaplan and Kay, 1994).(More)
The formal device of flmetional uncertainty has been introduced into linguistic theory as a means of characterizing long-distance dependencies alternative to conventional phrase-structure based approaches. In this palter we briefly outline the uneertMnty concept, and then present an algorithm for determining the satisfiability of acyclic gramu~atical(More)
We present an approach to statistical machine translation that combines ideas from phrase-based SMT and traditional grammar-based MT. Our system incorporates the concept of multi-word translation units into transfer of dependency structure snippets, and models and trains statistical components according to stateof-the-art SMT systems. Compliant with(More)
1 We are indebted to Milward (1994) for provoking and providing a starting point for this renewed research on coordination. Many of these ideas were discussed at various meetings and in email discussions and we thank the many participants: Caroline Brun, Max Copperman, Mary Dalrymple, Marc Dymetman, John Fry, Ron Kaplan, Lauri Karttunen, Martin Kay, Paula(More)
In this paper, we describe the types of sentence condensation rules used in the sentence condensation of Riezler et al. 2003 in detail. We show how the distinctions made in LFG f-structures as to grammatical functions and features make it possible to state simple but accurate rules to create smaller, well-formed f-structures from which the condensed(More)