## Parsing Inside-Out (1998)

### Cached

### Download Links

- [ftp.deas.harvard.edu]
- [arxiv.org]
- [research.microsoft.com]
- DBLP

### Other Repositories/Bibliography

Citations: | 82 - 2 self |

### BibTeX

@TECHREPORT{Goodman98parsinginside-out,

author = {Joshua T. Goodman},

title = {Parsing Inside-Out},

institution = {},

year = {1998}

}

### Years of Citing Articles

### OpenURL

### Abstract

Probabilistic Context-Free 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 non-terminal 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 n-best lists. We also present three novel uses for the inside and outside probabilities. T...