Results 1 
4 of
4
Parsing InsideOut
, 1998
"... Probabilistic ContextFree Grammars (PCFGs) and variations on them have recently become some of the most common formalisms for parsing. It is common with PCFGs to compute the inside and outside probabilities. When these probabilities are multiplied together and normalized, they produce the probabili ..."
Abstract

Cited by 85 (2 self)
 Add to MetaCart
Probabilistic ContextFree Grammars (PCFGs) and variations on them have recently become some of the most common formalisms for parsing. It is common with PCFGs to compute the inside and outside probabilities. When these probabilities are multiplied together and normalized, they produce the probability that any given nonterminal covers any piece of the input sentence. The traditional use of these probabilities is to improve the probabilities of grammar rules. In this thesis we show that these values are useful for solving many other problems in Statistical Natural Language Processing. We give a framework for describing parsers. The framework generalizes the inside and outside values to semirings. It makes it easy to describe parsers that compute a wide variety of interesting quantities, including the inside and outside probabilities, as well as related quantities such as Viterbi probabilities and nbest lists. We also present three novel uses for the inside and outside probabilities. T...
Semiring Parsing
 Computational Linguistics
, 1999
"... this paper is that all five of these commonly computed quantities can be described as elements of complete semirings (Kuich 1997). The relationship between grammars and semirings was discovered by Chomsky and Schtitzenberger (1963), and for parsing with the CKY algorithm, dates back to Teitelbaum ( ..."
Abstract

Cited by 66 (1 self)
 Add to MetaCart
this paper is that all five of these commonly computed quantities can be described as elements of complete semirings (Kuich 1997). The relationship between grammars and semirings was discovered by Chomsky and Schtitzenberger (1963), and for parsing with the CKY algorithm, dates back to Teitelbaum (1973). A complete semiring is a set of values over which a multiplicative operator and a commutative additive operator have been defined, and for which infinite summations are defined. For parsing algorithms satisfying certain conditions, the multiplicative and additive operations of any complete semiring can be used in place of/x and , and correct values will be returned. We will give a simple normal form for describing parsers, then precisely define complete semirings, and the conditions for correctness
Parse Forest Computation of Expected Governors
 In Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics
, 2001
"... In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation.
PhD Depth Examination Report Algebraic Foundation of Statistical Parsing Semiring Parsing
, 2004
"... Statistical parsing algorithms are useful in structure prediction applications, ranging from natural language processing to biological sequence analysis. Currently, there are a variety of efficient parsing algorithms available for different grammar formalisms. Conventionally, different parsing algor ..."
Abstract
 Add to MetaCart
Statistical parsing algorithms are useful in structure prediction applications, ranging from natural language processing to biological sequence analysis. Currently, there are a variety of efficient parsing algorithms available for different grammar formalisms. Conventionally, different parsing algorithms are needed for different tasks; a fair amount of work is required to construct for each one. Semiring parsing is proposed to provide a generalized and modularized framework to unify all these different parsing algorithms into a general framework and by separation of the underlying algebraic structure and search, it makes the very same algorithm perform across diverse tasks. One main concern about a semiring parsing system is efficiency. A packed representation for all possible target structures has been discussed in the literature and different heuristic search strategies have been explored. By investigating serveral structured probabilistic models, we found that all the