---
title: "Generalized Probabilistic LR Parsing of Natural Language"
description: "They describe an automatic way to compile the unification-based ANLT grammar into an LALR(1)… 76 references, cited by 43 papers here."
authors: ["Ted Briscoe", "John Carroll"]
year: 1993
venue: "Computational Linguistics"
source: "https://aclanthology.org/J93-1002/"
licence: "CC BY-NC-SA 3.0 (ACL Anthology, before 2016)"
licence_url: "https://creativecommons.org/licenses/by-nc-sa/3.0/"
summary_licence: "Elamur Cosmic License"
canonical: "https://research.elamur.ai/free/en/papers/briscoe-1993-generalized-probabilistic-lr-parsing-natural/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/briscoe-1993-generalized-probabilistic-lr-parsing-natural/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [1993](https://md.research.elamur.ai/free/en/papers/1993/) / Generalized Probabilistic LR Parsing of Natural Language (Corpora) with Unification-Based Grammars

# Generalized Probabilistic LR Parsing of Natural Language (Corpora) with Unification-Based Grammars

**Authors:** [Ted Briscoe](https://md.research.elamur.ai/free/en/authors/ted-briscoe/) and [John Carroll](https://md.research.elamur.ai/free/en/authors/john-carroll/) · **Year:** 1993 · **Venue:** [Computational Linguistics](https://md.research.elamur.ai/free/en/venues/cl/) ([Computational Linguistics 1993](https://md.research.elamur.ai/free/en/venues/cl/1993/)) · **Publisher:** [The MIT Press](https://md.research.elamur.ai/free/en/publishers/the-mit-press/) · **Licence:** [CC BY-NC-SA 3.0 (ACL Anthology, before 2016)](https://creativecommons.org/licenses/by-nc-sa/3.0/)

**Links:** [Publisher's page](https://aclanthology.org/J93-1002/) · [PDF](https://aclanthology.org/J93-1002.pdf) · [OpenAlex](https://openalex.org/W2130747650)

**Citations:** 188 citations (OpenAlex, 2026-10-14) · [43](https://md.research.elamur.ai/free/en/papers/briscoe-1993-generalized-probabilistic-lr-parsing-natural/cited-by/) in our library, of the 149,439 papers whose bibliographies we read

## Summary
Grammars with broad coverage of English typically license many analyses for a single sentence, sometimes thousands. Briscoe and Carroll address how to pick out the plausible analysis and how to adapt a general grammar to a particular sublanguage. They describe an automatic way to compile the unification-based ANLT grammar into an LALR(1) parse table. Two parsers use this table. The first is an interactive parser in which a human selects the correct derivation, which yields disambiguated training data with little manual effort. The second is a breadth-first probabilistic parser that attaches probabilities directly to LR table actions. Because these probabilities depend on parse state, the model can tell apart derivations that a probabilistic CFG would score identically. An optimized version of Tomita's generalized LR algorithm ran faster in practice than a well-indexed chart parser, even though its worst-case complexity is exponential. A pilot study on noun definitions from LDOCE produced encouraging results: rule-frequency statistics tracked the most plausible analysis usefully, though not perfectly. This makes statistical ranking available within a linguistically adequate grammar formalism.

## Key points
- The grammar is ANLT, with a lexicon of about 40,000 lexemes and roughly 700 phrase structure rules. Earlier work found that a previous version correctly analyzed 96.8% of 10,000 corpus noun phrases.
- Probabilities are assigned to LR parse-table actions rather than to CFG rules or lexical tags. This makes the language model sensitive to parse context.
- An interactive LR parser supports supervised training. A human chooses the correct analyses and adds grammar rules where coverage is missing.
- Generalized LR parsing based on Tomita (1987) was compared empirically with an optimized chart parser and was the more efficient of the two for ANLT.
- The pilot study trained on 150 LDOCE noun definitions and was retested on those plus 55 new ones. Definitions use a vocabulary of about 2,000 morphemes and average roughly 10 words, with a maximum of about 30.

*Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.*

## Institutions

- [University of Cambridge](https://md.research.elamur.ai/free/en/universities/university-of-cambridge/) — University, Cambridge, United Kingdom · 256 works · 123,373 citations

📚 Shelves (4): [🖥️ Computer Science](https://md.research.elamur.ai/free/en/shelves/computer-science/) · 18,614 works · [🤖 Artificial Intelligence](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · 17,965 works · [🎭 Arts and Humanities](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · 17,450 works · [🗣️ Language and Linguistics](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · 17,296 works

## Cite

Cite as: Ted Briscoe and John Carroll. 1993. Generalized Probabilistic LR Parsing of Natural Language (Corpora) with Unification-Based Grammars. Computational Linguistics.

The paper itself, not this page. BibTeX from the library's record of the work.

```bibtex
@article{briscoe1993generalized,
  title = {{Generalized Probabilistic LR Parsing of Natural Language (Corpora) with Unification-Based Grammars}},
  author = {Ted Briscoe and John Carroll},
  journal = {Computational Linguistics},
  year = {1993},
  url = {https://aclanthology.org/J93-1002/}
}
```

- [← previous An Algorithm for Finding Noun Phrase Correspondences in Bilingual Corpora](https://md.research.elamur.ai/free/en/papers/kupiec-1993-algorithm-finding-noun-phrase-correspondences/)
- [next → Two-level Description of Turkish Morphology](https://md.research.elamur.ai/free/en/papers/oflazer-1993-two-level-description-turkish-morphology/)
- [↑ back to papers of 1993](https://md.research.elamur.ai/free/en/papers/1993/)

## References

76 references, 7 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

1. Aho, A.; Sethi, R.; and Ullman, J. (1986). Compilers: Principles, Techniques and Tools. Addison-Wesley. [find](https://scholar.google.com/scholar?q=Aho%2C+A%2E%3B+Sethi%2C+R%2E%3B+and+Ullman%2C+J%2E+%281986%29%2E+Compilers%3A+Principles%2C+Techniques+and+Tools%2E+Addison%2DWesley%2E)
2. Alshawi, H., ed. (1992). The Core Language Engine. MIT Press. [find](https://scholar.google.com/scholar?q=Alshawi%2C+H%2E%2C+ed%2E+%281992%29%2E+The+Core+Language+Engine%2E+MIT+Press%2E)
3. Baker, J. (1982). "Trainable grammars for speech recognition." Speech Communication Papers for the 97th Meeting of the Acoustical Society of America, 547-550. [find](https://scholar.google.com/scholar?q=Baker%2C+J%2E+%281982%29%2E+%22Trainable+grammars+for+speech+recognition%2E%22+Speech+Communication+Papers+for+the+97th+Meeting+of+the+Acoustical+Society+of+America%2C+547%2D550%2E)
4. Baum, L. (1972). "An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes." Inequalities, III, 1-8. [find](https://scholar.google.com/scholar?q=Baum%2C+L%2E+%281972%29%2E+%22An+inequality+and+associated+maximization+technique+in+statistical+estimation+for+probabilistic+functions+of+Markov+processes%2E%22+Inequalities%2C+III%2C+1%2D8%2E)
5. Bermudez, M. (1991). "A unifying model for lookahead LR parsing." Computer Languages, 16(2), 167-178. [find](https://scholar.google.com/scholar?q=Bermudez%2C+M%2E+%281991%29%2E+%22A+unifying+model+for+lookahead+LR+parsing%2E%22+Computer+Languages%2C+16%282%29%2C+167%2D178%2E)
6. Boguraev, B.; Carroll, J.; Briscoe, E.; and Grover, C. (1988). "Software support for practical grammar development." In Proceedings, 12th International Conference on Computational Linguistics, Budapest, Hungary, 54-58. [find](https://scholar.google.com/scholar?q=Boguraev%2C+B%2E%3B+Carroll%2C+J%2E%3B+Briscoe%2C+E%2E%3B+and+Grover%2C+C%2E+%281988%29%2E+%22Software+support+for+practical+grammar+development%2E%22+In+Proceedings%2C+12th+International+Conference+on+Computational+Linguistics%2C+Budapes)
7. Brent, M. (1991). "Automatic acquisition of subcategorization frames from untagged text." In Proceedings, 29th Annual Meeting of the Association for Computational Linguistics, Berkeley, CA, 209-214. [find](https://scholar.google.com/scholar?q=Brent%2C+M%2E+%281991%29%2E+%22Automatic+acquisition+of+subcategorization+frames+from+untagged+text%2E%22+In+Proceedings%2C+29th+Annual+Meeting+of+the+Association+for+Computational+Linguistics%2C+Berkeley%2C+CA%2C+209%2D214%2E)
8. Briscoe, E. (1987). Modelling Human Speech Comprehension: A Computational Approach. Ellis Horwood and Wiley. [find](https://scholar.google.com/scholar?q=Briscoe%2C+E%2E+%281987%29%2E+Modelling+Human+Speech+Comprehension%3A+A+Computational+Approach%2E+Ellis+Horwood+and+Wiley%2E)
9. Briscoe, E.; Grover, C.; Boguraev, B.; and Carroll, J. (1987). "A formalism and environment for the development of a large grammar of English. In Proceedings, l Oth International Joint Conference on Artificial Intelligence, Milan, Italy, 703-708. [find](https://scholar.google.com/scholar?q=Briscoe%2C+E%2E%3B+Grover%2C+C%2E%3B+Boguraev%2C+B%2E%3B+and+Carroll%2C+J%2E+%281987%29%2E+%22A+formalism+and+environment+for+the+development+of+a+large+grammar+of+English%2E+In+Proceedings%2C+l+Oth+International+Joint+Conference+on+A)
10. Briscoe, E., and Carroll, J. (1991). "Generalized probabilistic LR parsing of natural language (corpora) with unification-based grammars." Technical Report 224, Computer Laboratory, Cambridge University. [find](https://scholar.google.com/scholar?q=Briscoe%2C+E%2E%2C+and+Carroll%2C+J%2E+%281991%29%2E+%22Generalized+probabilistic+LR+parsing+of+natural+language+%28corpora%29+with+unification%2Dbased+grammars%2E%22+Technical+Report+224%2C+Computer+Laboratory%2C+Cambridge+Universi)
11. Briscoe, E., and Waegner, N. (1992). "Robust stochastic parsing using the inside-outside algorithm." In Proceedings, AAAI Workshop on Statistically-based NLP Techniques, San Jose, CA. [find](https://scholar.google.com/scholar?q=Briscoe%2C+E%2E%2C+and+Waegner%2C+N%2E+%281992%29%2E+%22Robust+stochastic+parsing+using+the+inside%2Doutside+algorithm%2E%22+In+Proceedings%2C+AAAI+Workshop+on+Statistically%2Dbased+NLP+Techniques%2C+San+Jose%2C+CA%2E)
12. Carroll, J., and Grover, C. (1989). "The derivation of a large computational lexicon for English." In Computational Lexicography for Natural Language Processing, edited by B. Boguraev and E. Briscoe, 117-134. Longman. [find](https://scholar.google.com/scholar?q=Carroll%2C+J%2E%2C+and+Grover%2C+C%2E+%281989%29%2E+%22The+derivation+of+a+large+computational+lexicon+for+English%2E%22+In+Computational+Lexicography+for+Natural+Language+Processing%2C+edited+by+B%2E+Boguraev+and+E%2E+Briscoe%2C+)
13. Carroll, J.; Boguraev, B.; Grover, C.; and Briscoe, E. (1988). "The grammar development environment: a user guide." Technical Report 127, Computer Laboratory, Cambridge University. [find](https://scholar.google.com/scholar?q=Carroll%2C+J%2E%3B+Boguraev%2C+B%2E%3B+Grover%2C+C%2E%3B+and+Briscoe%2C+E%2E+%281988%29%2E+%22The+grammar+development+environment%3A+a+user+guide%2E%22+Technical+Report+127%2C+Computer+Laboratory%2C+Cambridge+University%2E)
14. Carroll, J., and Briscoe, E. (1992). "Probabilistic normalisation and unpacking of packed parse forests for unification-based grammars." In Proceedings, AAAI Fall Symposium on Probabilistic Approaches to Natural Language, Cambridge, MA, 33-38. [find](https://scholar.google.com/scholar?q=Carroll%2C+J%2E%2C+and+Briscoe%2C+E%2E+%281992%29%2E+%22Probabilistic+normalisation+and+unpacking+of+packed+parse+forests+for+unification%2Dbased+grammars%2E%22+In+Proceedings%2C+AAAI+Fall+Symposium+on+Probabilistic+Approaches)
15. Chapman, N. (1987). LR Parsing: Theory and Practice. Cambridge University Press. [find](https://scholar.google.com/scholar?q=Chapman%2C+N%2E+%281987%29%2E+LR+Parsing%3A+Theory+and+Practice%2E+Cambridge+University+Press%2E)
16. Church, K., and Hanks, P. (1989). "[Word association norms, mutual information, and lexicography](https://md.research.elamur.ai/free/en/papers/church-1990-word-association-norms-mutual-information/)." In Proceedings, 27th Annual Meeting of the Association for Computational Linguistics, Vancouver, British Columbia, 76-83.
17. Church, K., and Patil, R. (1982). "Coping with syntactic ambiguity or how to put the block in the box on the table." Computational Linguistics, 8, 139-149. [find](https://scholar.google.com/scholar?q=Church%2C+K%2E%2C+and+Patil%2C+R%2E+%281982%29%2E+%22Coping+with+syntactic+ambiguity+or+how+to+put+the+block+in+the+box+on+the+table%2E%22+Computational+Linguistics%2C+8%2C+139%2D149%2E)
18. Copestake, A. (1990). "An approach to building the hierarchical element of a lexical knowledge base from a machine-readable dictionary." In Proceedings, Workshop on Inheritance in Natural Language Processing, Tilburg, 19-29. [find](https://scholar.google.com/scholar?q=Copestake%2C+A%2E+%281990%29%2E+%22An+approach+to+building+the+hierarchical+element+of+a+lexical+knowledge+base+from+a+machine%2Dreadable+dictionary%2E%22+In+Proceedings%2C+Workshop+on+Inheritance+in+Natural+Language+Pro)
19. Copestake, A. (1992). "Defaults in lexical representation." In Default Inheritance in Unification-based Approaches to the Lexicon, edited by E. Briscoe, A. Copestake, and V. de Paiva. Cambridge University Press. [find](https://scholar.google.com/scholar?q=Copestake%2C+A%2E+%281992%29%2E+%22Defaults+in+lexical+representation%2E%22+In+Default+Inheritance+in+Unification%2Dbased+Approaches+to+the+Lexicon%2C+edited+by+E%2E+Briscoe%2C+A%2E+Copestake%2C+and+V%2E+de+Paiva%2E+Cambridge+Univer)
20. Culic, K. II, and Cohen, R. (1973). "LR-regular grammars--an extension of LR(k) grammars." Journal of Computer and System Sciences, 7, 66-96. [find](https://scholar.google.com/scholar?q=Culic%2C+K%2E+II%2C+and+Cohen%2C+R%2E+%281973%29%2E+%22LR%2Dregular+grammars%2D%2Dan+extension+of+LR%28k%29+grammars%2E%22+Journal+of+Computer+and+System+Sciences%2C+7%2C+66%2D96%2E)
21. Cutting, D.; Kupiec, J.; Pedersen, J.; and Sibun, P. (1992). "[A practical part-of-speech tagger](https://md.research.elamur.ai/free/en/papers/cutting-1992-practical-part-speech-tagger/)." 3rd Applied ACL, Trento, Italy, 133-140.
22. DeRemer, E, and Pennello, T. (1982). "Efficient computation of LALR(1) look-ahead sets." ACM Transactions on Programming Languages and Systems, 4(4), 615-649. de Rose, S. (1988). "[Grammatical category disambiguation by statistical optimization](https://md.research.elamur.ai/free/en/papers/derose-1988-grammatical-category-disambiguation-statistical-optimization/)." Computational Linguistics, 14(1), 31-39.
23. Earley, J. (1970). "An efficient context-free parsing algorithm." Communications of the ACM, 13(2), 94-102. [find](https://scholar.google.com/scholar?q=Earley%2C+J%2E+%281970%29%2E+%22An+efficient+context%2Dfree+parsing+algorithm%2E%22+Communications+of+the+ACM%2C+13%282%29%2C+94%2D102%2E)
24. Frazier, L. (1988). "Grammar and language processing." In Linguistics: The Cambridge Survey, Volume 2, edited by F. Newmeyer, 14-45. Cambridge University Press. [find](https://scholar.google.com/scholar?q=Frazier%2C+L%2E+%281988%29%2E+%22Grammar+and+language+processing%2E%22+In+Linguistics%3A+The+Cambridge+Survey%2C+Volume+2%2C+edited+by+F%2E+Newmeyer%2C+14%2D45%2E+Cambridge+University+Press%2E)
25. Fujisaki, T.; Jelinek, E; Cocke, J.; Black E.; and Nishino, T. (1989). "A probabilistic method for sentence disambiguation." In Proceedings, 1st International Workshop on Parsing Technologies, Carnegie-Mellon University, Pittsburgh, PA, 105-114. [find](https://scholar.google.com/scholar?q=Fujisaki%2C+T%2E%3B+Jelinek%2C+E%3B+Cocke%2C+J%2E%3B+Black+E%2E%3B+and+Nishino%2C+T%2E+%281989%29%2E+%22A+probabilistic+method+for+sentence+disambiguation%2E%22+In+Proceedings%2C+1st+International+Workshop+on+Parsing+Technologies%2C+Carnegi)
26. Gale, W., and Church, K. (1990). "Poor estimates of context are worse than none." DARPA Speech and Natural Language Workshop, Hidden Valley, PA, 283-287. [find](https://scholar.google.com/scholar?q=Gale%2C+W%2E%2C+and+Church%2C+K%2E+%281990%29%2E+%22Poor+estimates+of+context+are+worse+than+none%2E%22+DARPA+Speech+and+Natural+Language+Workshop%2C+Hidden+Valley%2C+PA%2C+283%2D287%2E)
27. Garside, R.; Leech, G.; and Sampson, G. (1987). The Computational Analysis of English: A Corpus-Based Approach. [find](https://scholar.google.com/scholar?q=Garside%2C+R%2E%3B+Leech%2C+G%2E%3B+and+Sampson%2C+G%2E+%281987%29%2E+The+Computational+Analysis+of+English%3A+A+Corpus%2DBased+Approach%2E)
28. Gazdar, G.; Klein, E.; Pullum, G.; and Sag, I. (1985). Generalized Phrase Structure Grammar. Blackwell. [find](https://scholar.google.com/scholar?q=Gazdar%2C+G%2E%3B+Klein%2C+E%2E%3B+Pullum%2C+G%2E%3B+and+Sag%2C+I%2E+%281985%29%2E+Generalized+Phrase+Structure+Grammar%2E+Blackwell%2E)
29. Gazdar, G., and Mellish, C. (1989). Natural Language Processing in Lisp. [find](https://scholar.google.com/scholar?q=Gazdar%2C+G%2E%2C+and+Mellish%2C+C%2E+%281989%29%2E+Natural+Language+Processing+in+Lisp%2E)
30. Grosch, J. (1990). "Lalr--A generator for efficient parsers." Software--Practice and Experience, 20(11), 1115-1135. [find](https://scholar.google.com/scholar?q=Grosch%2C+J%2E+%281990%29%2E+%22Lalr%2D%2DA+generator+for+efficient+parsers%2E%22+Software%2D%2DPractice+and+Experience%2C+20%2811%29%2C+1115%2D1135%2E)
31. Grover, C.; Briscoe, E.; Carroll, J.; and Boguraev, B. (1989). "The Alvey natural language tools grammar (second release)." Technical Report 162, Computer Laboratory, Cambridge University. [find](https://scholar.google.com/scholar?q=Grover%2C+C%2E%3B+Briscoe%2C+E%2E%3B+Carroll%2C+J%2E%3B+and+Boguraev%2C+B%2E+%281989%29%2E+%22The+Alvey+natural+language+tools+grammar+%28second+release%29%2E%22+Technical+Report+162%2C+Computer+Laboratory%2C+Cambridge+University%2E)
32. Hektoen, E. (1991). "LAR processing for natural language grammars." Masters dissertation, Computer Laboratory, Cambridge University, Cambridge, U.K. [find](https://scholar.google.com/scholar?q=Hektoen%2C+E%2E+%281991%29%2E+%22LAR+processing+for+natural+language+grammars%2E%22+Masters+dissertation%2C+Computer+Laboratory%2C+Cambridge+University%2C+Cambridge%2C+U%2EK%2E)
33. Hindle, D., and Rooth, M. (1991). "[Structural ambiguity and lexical relations](https://md.research.elamur.ai/free/en/papers/hindle-1993-structural-ambiguity-lexical-relations/)." In Proceedings, 29th Annual Meeting of the Association for Computational Linguistics, Berkeley, CA, 229-236.
34. Holmes, J. (1988). Speech Synthesis and Recognition. Van Nostrand Reinhold. [find](https://scholar.google.com/scholar?q=Holmes%2C+J%2E+%281988%29%2E+Speech+Synthesis+and+Recognition%2E+Van+Nostrand+Reinhold%2E)
35. Jensen, K.; Heidorn, G.; Miller, L.; and Ravin, Y. (1983), "[Parse fitting and prose fixing: getting a hold on ill-formedness](https://md.research.elamur.ai/free/en/papers/jensen-1983-parse-fitting-prose-fixing-getting/)." Computational Linguistics, 9, 147-153.
36. Johnson, M. (1989). "The computational complexity of Tomita's algorithm." In Proceedings, Ist International Workshop on Parsing Technologies, Carnegie-Mellon University, Pittsburgh, PA, 203-208. [find](https://scholar.google.com/scholar?q=Johnson%2C+M%2E+%281989%29%2E+%22The+computational+complexity+of+Tomita%27s+algorithm%2E%22+In+Proceedings%2C+Ist+International+Workshop+on+Parsing+Technologies%2C+Carnegie%2DMellon+University%2C+Pittsburgh%2C+PA%2C+203%2D208%2E)
37. Kimball, J. (1973). "Seven principles of surface structure parsing in natural language." Cognition, 2, 15-47. [find](https://scholar.google.com/scholar?q=Kimball%2C+J%2E+%281973%29%2E+%22Seven+principles+of+surface+structure+parsing+in+natural+language%2E%22+Cognition%2C+2%2C+15%2D47%2E)
38. Kipps, J. (1989). "Analysis of Tomita's algorithm for general context-free parsing." In Proceedings, 1st International Workshop on Parsing Technologies, Carnegie-Mellon University, Pittsburgh, PA, 193-202. [find](https://scholar.google.com/scholar?q=Kipps%2C+J%2E+%281989%29%2E+%22Analysis+of+Tomita%27s+algorithm+for+general+context%2Dfree+parsing%2E%22+In+Proceedings%2C+1st+International+Workshop+on+Parsing+Technologies%2C+Carnegie%2DMellon+University%2C+Pittsburgh%2C+PA%2C+193)
39. Klein, E., and Martin, M. (1989). "The parser generating system PGSU." Software-- Practice and Experience, 19(11), 1015-1028. [find](https://scholar.google.com/scholar?q=Klein%2C+E%2E%2C+and+Martin%2C+M%2E+%281989%29%2E+%22The+parser+generating+system+PGSU%2E%22+Software%2D%2D+Practice+and+Experience%2C+19%2811%29%2C+1015%2D1028%2E)
40. Kristensen, B., and Madsen, O. (1981). "Methods for computing LALR(k) lookahead." ACM Transactions on Programming Languages and Systems, 3(1), 60-82. [find](https://scholar.google.com/scholar?q=Kristensen%2C+B%2E%2C+and+Madsen%2C+O%2E+%281981%29%2E+%22Methods+for+computing+LALR%28k%29+lookahead%2E%22+ACM+Transactions+on+Programming+Languages+and+Systems%2C+3%281%29%2C+60%2D82%2E)
41. Kupiec, J. (1991). "A trellis-based algorithm for estimating the parameters of a hidden stochastic context-free grammar," DARPA Speech and Natural Language Workshop, Asilomar, CA. [find](https://scholar.google.com/scholar?q=Kupiec%2C+J%2E+%281991%29%2E+%22A+trellis%2Dbased+algorithm+for+estimating+the+parameters+of+a+hidden+stochastic+context%2Dfree+grammar%2C%22+DARPA+Speech+and+Natural+Language+Workshop%2C+Asilomar%2C+CA%2E)
42. Lari, K., and Young, S. (1990). "The estimation of stochastic context-free grammars using the Inside-Outside algorithm." Computer Speech and Language Processing, 4, 35-56. [find](https://scholar.google.com/scholar?q=Lari%2C+K%2E%2C+and+Young%2C+S%2E+%281990%29%2E+%22The+estimation+of+stochastic+context%2Dfree+grammars+using+the+Inside%2DOutside+algorithm%2E%22+Computer+Speech+and+Language+Processing%2C+4%2C+35%2D56%2E)
43. Leech, G., and Garside, R. (1991). "Running a grammar factory: the production of syntactically analysed corpora or 'treebanks'." In English Computer Corpora: Selected Papers and Bibliography, edited by S. Johansson and A. Strenstrom. Mouton de Gruyter. [find](https://scholar.google.com/scholar?q=Leech%2C+G%2E%2C+and+Garside%2C+R%2E+%281991%29%2E+%22Running+a+grammar+factory%3A+the+production+of+syntactically+analysed+corpora+or+%27treebanks%27%2E%22+In+English+Computer+Corpora%3A+Selected+Papers+and+Bibliography%2C+edited+b)
44. Magerman, D., and Marcus, M. (1991). "Pearl: A probabilistic chart parser." In Proceedings, 2nd International Workshop on Parsing Technologies, Cancun, Mexico, 193-199. [find](https://scholar.google.com/scholar?q=Magerman%2C+D%2E%2C+and+Marcus%2C+M%2E+%281991%29%2E+%22Pearl%3A+A+probabilistic+chart+parser%2E%22+In+Proceedings%2C+2nd+International+Workshop+on+Parsing+Technologies%2C+Cancun%2C+Mexico%2C+193%2D199%2E)
45. Meteer, M.; Schwartz, R.; and Weischedel, R. (1991). "POST: Using probabilities in language processing." In Proceedings, 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, 960-965. [find](https://scholar.google.com/scholar?q=Meteer%2C+M%2E%3B+Schwartz%2C+R%2E%3B+and+Weischedel%2C+R%2E+%281991%29%2E+%22POST%3A+Using+probabilities+in+language+processing%2E%22+In+Proceedings%2C+12th+International+Joint+Conference+on+Artificial+Intelligence%2C+Sydney%2C+Austral)
46. Nakazawa, T. (1991). "An extended LR parsing algorithm for grammars using feature-based syntactic categories." In Proceedings, 5th European Conference of the Association for Computational Linguistics, Berlin, Germany, 69-74. [find](https://scholar.google.com/scholar?q=Nakazawa%2C+T%2E+%281991%29%2E+%22An+extended+LR+parsing+algorithm+for+grammars+using+feature%2Dbased+syntactic+categories%2E%22+In+Proceedings%2C+5th+European+Conference+of+the+Association+for+Computational+Linguistics%2C)
47. Ng, S.-K., and Tomita, M. (1991). "Probabilistic parsing for general context-free grammars." In Proceedings, 2nd International Workshop on Parsing Technologies, Cancun, Mexico, 154-163. [find](https://scholar.google.com/scholar?q=Ng%2C+S%2E%2DK%2E%2C+and+Tomita%2C+M%2E+%281991%29%2E+%22Probabilistic+parsing+for+general+context%2Dfree+grammars%2E%22+In+Proceedings%2C+2nd+International+Workshop+on+Parsing+Technologies%2C+Cancun%2C+Mexico%2C+154%2D163%2E)
48. Osborne, M. (1990). "Corpus parsing." Masters dissertation, University of Cambridge, Cambridge, U.K. [find](https://scholar.google.com/scholar?q=Osborne%2C+M%2E+%281990%29%2E+%22Corpus+parsing%2E%22+Masters+dissertation%2C+University+of+Cambridge%2C+Cambridge%2C+U%2EK%2E)
49. Pereira, E, and Shieber, S. (1987). Prolog and Natural Language Analysis. University of Chicago Press. [find](https://scholar.google.com/scholar?q=Pereira%2C+E%2C+and+Shieber%2C+S%2E+%281987%29%2E+Prolog+and+Natural+Language+Analysis%2E+University+of+Chicago+Press%2E)
50. Pereira, F., and Warren, D. (1980). "Definite clause grammars for language analysis--a survey of the formalism and a comparison with augmented transition networks." Artificial Intelligence, 13(3), 231-278. [find](https://scholar.google.com/scholar?q=Pereira%2C+F%2E%2C+and+Warren%2C+D%2E+%281980%29%2E+%22Definite+clause+grammars+for+language+analysis%2D%2Da+survey+of+the+formalism+and+a+comparison+with+augmented+transition+networks%2E%22+Artificial+Intelligence%2C+13%283%29%2C+231)
51. Pereira, E, and Schabes, Y. (1992). "Inside-outside re-estimation for partially bracketed corpora." In Proceedings, 30th Annual Meeting of the Association for Computational Linguistics, Newark, DE, 128-135. [find](https://scholar.google.com/scholar?q=Pereira%2C+E%2C+and+Schabes%2C+Y%2E+%281992%29%2E+%22Inside%2Doutside+re%2Destimation+for+partially+bracketed+corpora%2E%22+In+Proceedings%2C+30th+Annual+Meeting+of+the+Association+for+Computational+Linguistics%2C+Newark%2C+DE%2C+12)
52. Pollack, M., and Pereira, E (1988). "[An integrated framework for semantic and pragmatic interpretation](https://md.research.elamur.ai/free/en/papers/pollack-1988-integrated-framework-semantic-pragmatic-interpretation/)." In Proceedings, 26th Annual Conference of the Association for Computational Linguistics, Buffalo, NY, 75-86.
53. Pollard, C., and Sag, I. (1987). [find](https://scholar.google.com/scholar?q=Pollard%2C+C%2E%2C+and+Sag%2C+I%2E+%281987%29%2E)
54. Information~Based Syntax and Semantics: Volume 1--Fundamentals. Chicago University Press. [find](https://scholar.google.com/scholar?q=Information%7EBased+Syntax+and+Semantics%3A+Volume+1%2D%2DFundamentals%2E+Chicago+University+Press%2E)
55. Procter, P., ed. (1978). The Longman Dictionary of Contemporary English. Longman. [find](https://scholar.google.com/scholar?q=Procter%2C+P%2E%2C+ed%2E+%281978%29%2E+The+Longman+Dictionary+of+Contemporary+English%2E+Longman%2E)
56. Ritchie, G.; Pulman, S.; Russell, G.; and Black, A. (1987). "A computational framework for lexical description." Computational Linguistics, 13, 290-307. [find](https://scholar.google.com/scholar?q=Ritchie%2C+G%2E%3B+Pulman%2C+S%2E%3B+Russell%2C+G%2E%3B+and+Black%2C+A%2E+%281987%29%2E+%22A+computational+framework+for+lexical+description%2E%22+Computational+Linguistics%2C+13%2C+290%2D307%2E)
57. Sampson, G. (1987). "The grammatical database and parsing scheme." In The Computational Analysis of English: A Corpus-Based Approach, edited by R. Garside; G. Leech; and G. Sampson, 82-96. Longman. [find](https://scholar.google.com/scholar?q=Sampson%2C+G%2E+%281987%29%2E+%22The+grammatical+database+and+parsing+scheme%2E%22+In+The+Computational+Analysis+of+English%3A+A+Corpus%2DBased+Approach%2C+edited+by+R%2E+Garside%3B+G%2E+Leech%3B+and+G%2E+Sampson%2C+82%2D96%2E+Longman%2E)
58. Sampson, G.; Haigh, R.; and Atwell, E. (1989). "Natural language analysis by stochastic optimization: a progress report on Project APRIL." Journal of Experimental and Theoretical Artificial Intelligence, 1, 271-287. [find](https://scholar.google.com/scholar?q=Sampson%2C+G%2E%3B+Haigh%2C+R%2E%3B+and+Atwell%2C+E%2E+%281989%29%2E+%22Natural+language+analysis+by+stochastic+optimization%3A+a+progress+report+on+Project+APRIL%2E%22+Journal+of+Experimental+and+Theoretical+Artificial+Intelligen)
59. Santorini, B. (1990). "Penn treebank tagging and parsing manual." University of Pennsylvania, CIS Dept. Unpublished manuscript. [find](https://scholar.google.com/scholar?q=Santorini%2C+B%2E+%281990%29%2E+%22Penn+treebank+tagging+and+parsing+manual%2E%22+University+of+Pennsylvania%2C+CIS+Dept%2E+Unpublished+manuscript%2E)
60. Schabes, Y. (1991a). "Polynomial time and space shift-reduce parsing of arbitrary contexbfree grammars." In Proceedings, 29th Annual Meeting of the Association for Computational Linguistics, Berkeley, CA, 106-113. [find](https://scholar.google.com/scholar?q=Schabes%2C+Y%2E+%281991a%29%2E+%22Polynomial+time+and+space+shift%2Dreduce+parsing+of+arbitrary+contexbfree+grammars%2E%22+In+Proceedings%2C+29th+Annual+Meeting+of+the+Association+for+Computational+Linguistics%2C+Berkeley%2C)
61. Schabes, Y. (1991b). "The valid prefix property and left to right parsing of tree-adjoining grammar." In Proceedings, 2nd International Workshop on Parsing Technologies, Cancun, Mexico, 21-30. [find](https://scholar.google.com/scholar?q=Schabes%2C+Y%2E+%281991b%29%2E+%22The+valid+prefix+property+and+left+to+right+parsing+of+tree%2Dadjoining+grammar%2E%22+In+Proceedings%2C+2nd+International+Workshop+on+Parsing+Technologies%2C+Cancun%2C+Mexico%2C+21%2D30%2E)
62. Sharman, R. (1989). "Probabilistic ID/LP grammars for English." Report 217, IBM UK Scientific Centre, Winchester, England. [find](https://scholar.google.com/scholar?q=Sharman%2C+R%2E+%281989%29%2E+%22Probabilistic+ID%2FLP+grammars+for+English%2E%22+Report+217%2C+IBM+UK+Scientific+Centre%2C+Winchester%2C+England%2E)
63. Sharman, R. (1991). "An introduction to language modelling." Unpublished manuscript, IBM UK Scientific Centre, Winchester, England. [find](https://scholar.google.com/scholar?q=Sharman%2C+R%2E+%281991%29%2E+%22An+introduction+to+language+modelling%2E%22+Unpublished+manuscript%2C+IBM+UK+Scientific+Centre%2C+Winchester%2C+England%2E)
64. Sharman, R.; Jelinek, F.; and Mercer, R. (1990). "Generating a grammar for statistical training." DARPA Speech and Natural Language Workshop, Hidden Valley, PA, 267-274. [find](https://scholar.google.com/scholar?q=Sharman%2C+R%2E%3B+Jelinek%2C+F%2E%3B+and+Mercer%2C+R%2E+%281990%29%2E+%22Generating+a+grammar+for+statistical+training%2E%22+DARPA+Speech+and+Natural+Language+Workshop%2C+Hidden+Valley%2C+PA%2C+267%2D274%2E)
65. Shieber, S. (1983). "Disambiguation by a shift-reduce parsing technique." In Proceedings, 21st Annual Meeting of the Association for Computational Linguistics, MIT, Cambridge, MA, 113-118. [find](https://scholar.google.com/scholar?q=Shieber%2C+S%2E+%281983%29%2E+%22Disambiguation+by+a+shift%2Dreduce+parsing+technique%2E%22+In+Proceedings%2C+21st+Annual+Meeting+of+the+Association+for+Computational+Linguistics%2C+MIT%2C+Cambridge%2C+MA%2C+113%2D118%2E)
66. Shieber, S. (1984). "The design of a computer language for linguistic information." In Proceedings, l Oth International Conference on Computational Linguistics, Stanford, CA, 362-366. [find](https://scholar.google.com/scholar?q=Shieber%2C+S%2E+%281984%29%2E+%22The+design+of+a+computer+language+for+linguistic+information%2E%22+In+Proceedings%2C+l+Oth+International+Conference+on+Computational+Linguistics%2C+Stanford%2C+CA%2C+362%2D366%2E)
67. Shieber, S. (1985). "Using restriction to extend parsing algorithms for complex feature-based formalisms." In Proceedings, 23rd Annual Meeting of the Association for Computational Linguistics, Chicago, IL, 145-152. [find](https://scholar.google.com/scholar?q=Shieber%2C+S%2E+%281985%29%2E+%22Using+restriction+to+extend+parsing+algorithms+for+complex+feature%2Dbased+formalisms%2E%22+In+Proceedings%2C+23rd+Annual+Meeting+of+the+Association+for+Computational+Linguistics%2C+Chicago)
68. Spector, D. (1983). "Lexing and parsing modula-2." SIGPLANNotices, 18(10), 25-32. [find](https://scholar.google.com/scholar?q=Spector%2C+D%2E+%281983%29%2E+%22Lexing+and+parsing+modula%2D2%2E%22+SIGPLANNotices%2C+18%2810%29%2C+25%2D32%2E)
69. Taylor, L.; Grover, C.; and Briscoe, E. (1989). "[The syntactic regularity of English noun phrases](https://md.research.elamur.ai/free/en/papers/taylor-1989-syntactic-regularity-english-noun-phrases/)." In Proceedings, 4th European Meeting of the Association for Computational Linguistics, UMIST, Manchester, U.K., 256-263.
70. Tomita, M. (1984). "Parsers for natural languages." In Proceedings, lOth International Conference on Computational Linguistics, Stanford, CA, 354-357. [find](https://scholar.google.com/scholar?q=Tomita%2C+M%2E+%281984%29%2E+%22Parsers+for+natural+languages%2E%22+In+Proceedings%2C+lOth+International+Conference+on+Computational+Linguistics%2C+Stanford%2C+CA%2C+354%2D357%2E)
71. Tomita, M. (1987). "An efficient augmented context-free parsing algorithm." Computational Linguistics, 13(1), 31--46. [find](https://scholar.google.com/scholar?q=Tomita%2C+M%2E+%281987%29%2E+%22An+efficient+augmented+context%2Dfree+parsing+algorithm%2E%22+Computational+Linguistics%2C+13%281%29%2C+31%2D%2D46%2E)
72. Viterbi, A. (1967). "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm." IEEE Trans. Information Theory, IT-13, 260-269. [find](https://scholar.google.com/scholar?q=Viterbi%2C+A%2E+%281967%29%2E+%22Error+bounds+for+convolutional+codes+and+an+asymptotically+optimum+decoding+algorithm%2E%22+IEEE+Trans%2E+Information+Theory%2C+IT%2D13%2C+260%2D269%2E)
73. Wright, J. (1990). "LR parsing of probabilistic grammars with input uncertainty for speech recognition." Computer Speech and Language, 4, 297-323. [find](https://scholar.google.com/scholar?q=Wright%2C+J%2E+%281990%29%2E+%22LR+parsing+of+probabilistic+grammars+with+input+uncertainty+for+speech+recognition%2E%22+Computer+Speech+and+Language%2C+4%2C+297%2D323%2E)
74. Wright, J., and Wrigley, E. (1989). "Probabilistic LR parsing for speech recognition." In Proceedings, 1st International Workshop on Parsing Technologies, Carnegie-Mellon University, Pittsburgh, PA, 193-202. [find](https://scholar.google.com/scholar?q=Wright%2C+J%2E%2C+and+Wrigley%2C+E%2E+%281989%29%2E+%22Probabilistic+LR+parsing+for+speech+recognition%2E%22+In+Proceedings%2C+1st+International+Workshop+on+Parsing+Technologies%2C+Carnegie%2DMellon+University%2C+Pittsburgh%2C+PA%2C+1)
75. Wright, J.; Wrigley, E.; and Sharman, R. (1991). "Adaptive probabilistic generalized LR parsing." In Proceedings, 2nd International Workshop on Parsing Technologies, Cancun, Mexico, 154-163. [find](https://scholar.google.com/scholar?q=Wright%2C+J%2E%3B+Wrigley%2C+E%2E%3B+and+Sharman%2C+R%2E+%281991%29%2E+%22Adaptive+probabilistic+generalized+LR+parsing%2E%22+In+Proceedings%2C+2nd+International+Workshop+on+Parsing+Technologies%2C+Cancun%2C+Mexico%2C+154%2D163%2E)
76. Zeevat, H.; Calder, J.; and Klein, E. (1987). Unification categorial grammar. In Edinburgh Working Papers in Cognitive Science, 1: Categorial Grammar, Unification Grammar, and Parsing, edited by N. Haddock, E. Klein, and G. Morrill, Centre for Cognitive Science, Edinburgh University, U.K., 195-222. [find](https://scholar.google.com/scholar?q=Zeevat%2C+H%2E%3B+Calder%2C+J%2E%3B+and+Klein%2C+E%2E+%281987%29%2E+Unification+categorial+grammar%2E+In+Edinburgh+Working+Papers+in+Cognitive+Science%2C+1%3A+Categorial+Grammar%2C+Unification+Grammar%2C+and+Parsing%2C+edited+by+N%2E+Ha)

*Updated 30 October 2026*