Estimators for Stochastic ``Unification-Based'' Grammars
arXiv (Cornell University)Published 25 August 2000Open access
Mark Johnson, Stuart Geman, Stephen Canon, Zhiyi Chi, Stefan Riezler
Citations2
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Log-linear models provide a statistically sound framework for Stochastic ``Unification-Based'' Grammars (SUBGs) and stochastic versions of other kinds of grammars. We describe two computationally-tractable ways of estimating the parameters of such grammars from a training corpus of syntactic analyses, and apply these to estimate a stochastic version of Lexical-Functional Grammar.
Keywords
Computer Science
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
16,927 Citations1988Judea Pearl
The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic.
Computational LinguisticsA maximum entropy approach to natural language processing
3,120 Citations1996Adam Berger, Vincent J. Della Pietra +1 more
A maximum-likelihood approach for automatically constructing maximum entropy models is presented and how to implement this approach efficiently is described, using as examples several problems in natural language processing.
Journal of the American Statistical AssociationStatistical Methods for Speech Recognition
1,988 Citations1999Don X. Sun, Frederick Jelinek
The speech recognition problem hidden Markov models the acoustic model basic language modelling the Viterbi search hypothesis search on a tree and the fast match elements of information theory.
Computers & Mathematics with ApplicationsGraphical models for machine learning and digital communication
465 Citations1999
A Method for Disjunctive Constraint Satisfaction
95 Citations1991John T. Maxwell, Ronald M. Kaplan
A distinctive property of many current grammatical formalisms is their use of feature equality constraints to express a wide variety of grammatical dependencies.
Two principles of parse preference
54 Citations1990Jerry R. Hobbs, John Bear
A compendium of many of the heuristics devised for choosing the preferred parses in the DIALOGIC system is presented and two principles that seem to underlie them are proposed.
Probability models for complex systems
23 Citations1998Stuart Gonan, Zhiyi Chi
This thesis is a collection of essays on probability models for complex systems that develops a novel model on the origin of scale invariance of natural images and proposes a probabilistic feature based model for languages.