References
-
Albro []
-
Daniel M. Albro.
An earley-style recognition algorithm for mcfgs.
- Avarind K. Joshi and Weir. [1992]
-
K. Vijay-Shanker Avarind K. Joshi and David Weir.
The convergence of mildly context-sensitive grammars.
In S. M. Shieber and T. Wasow, editors, The Processing of
Natural Language Structure. MIT Press, 1992.
- Billot and Lang [1989]
-
Sylvie Billot and Bernard Lang.
The structure of shared forests in ambiguous parsing.
In Proceedings of the 27th annual meeting on Association for
Computational Linguistics, pages 143–151. Association for Computational
Linguistics Morristown, NJ, USA, 1989.
- Chi [1999]
-
Zhiyi Chi.
Statistical properties of probabilistic context-free grammars.
Computational Linguistics, 25 (1): 131–160,
1999.
- Goodman [1999]
-
Josh Goodman.
Semiring parsing.
Computational Linguistics, 25 (4): 573–605,
1999.
- Grenander [1967]
-
Ulf Grenander.
Syntax-controlled Probabilities.
Division of Applied Mathematics, Brown University, 1967.
- Guillaumin [2004]
-
Matthieu Guillaumin.
Conversions between mildly context sensitive grammars.
2004.
- H. Seki and Kasami [1991]
-
M. Fujii H. Seki, T. Matsumura and T. Kasami.
On multiple context-free grammars.
Theoretical Computer Science, 1991.
- Hale [2001]
-
John T. Hale.
A probabilistic Earley parser as a psycholinguistic model.
In Proceedings of NAACL, volume 2, pages 159–166, 2001.
- Hale [2006]
-
John T. Hale.
Uncertainity About The Rest of The Sentence.
Cognitive Science, 2006.
- Jelinek and Lafferty [1991]
-
Frederick Jelinek and John D. Lafferty.
Computation of the probability of initial substring generation by
stochastic context-free grammars.
Computational Linguistics, 17 (3): 315–323,
1991.
ISSN 0891-2017.
- Joshi [1985]
-
Avarind K. Joshi.
Tree Adjoining Grammars: How Much Context-Sensitivity Is Required to
Provide Reasonable Structural Descriptions?
Natural Language Parsing: Psychological, Computational and
Theoretical Perspectives, 1985.
- Kallmeyer [2010]
-
Laura Kallmeyer.
Parsing Beyond Context-Free Grammars.
Not Avail, 2010.
ISBN 364214845X.
- Lang [1988]
-
Bernard Lang.
Parsing incomplete sentences.
In Proceedings of the 12th conference on Computational
linguistics-Volume 1, pages 365–371. Association for Computational
Linguistics Morristown, NJ, USA, 1988.
- Manning et al. [1999]
-
C.D. Manning, H. Schütze, and MIT Press.
Foundations of statistical natural language processing.
MIT Press, 1999.
- Nakanishi et al. [1997]
-
R. Nakanishi, K. Takada, and H. Seki.
An efficient recognition algorithm for multiple context free
languages.
Proceedings of the Fifth Meeting on Mathematics of Language,
MOL5, 1997.
- Nederhof and Satta [2006]
-
Mark-Jan Nederhof and Giorgio Satta.
Estimation of consistent probabilistic context-free grammars.
In Proceedings of the main conference on Human Language
Technology Conference of the North American Chapter of the Association of
Computational Linguistics, pages 343–350. Association for Computational
Linguistics Morristown, NJ, USA, 2006.
- Nederhof and Satta [2008]
-
Mark-Jan Nederhof and Giorgio Satta.
Computing partition functions of PCFGs.
Research on Language & Computation, 6 (2):
139–162, 2008.
ISSN 1570-7075.
- O’Donnell et al. [2009]
-
Timothy J. O’Donnell, Noah D. Goodman, and Josh B. Tenenbaum.
Fragment Grammars: Exploring Computation and Reuse in Language.
2009.
- Paulson [1996]
-
Lawrence C. Paulson.
ML for the Working Programmer.
Cambridge Univ Pr, 1996.
ISBN 052156543X.
- Shieber et al. [1995]
-
Stuart M. Shieber, Yves Schabes, and Fernando C.N. Pereira.
Principles and implementation of deductive parsing.
The Journal of Logic Programming, 24 (1-2):
3–36, 1995.
- Stabler [1997]
-
Edward P. Stabler.
Derivational minimalism.
In Logical Aspects of Computational Linguistics., pages
68–95. Springer, 1997.
- Steedman [2000]
-
Mark Steedman.
The Syntatcic Process.
MIT Press, 2000.
- Stolcke [1995]
-
Andreas Stolcke.
An efficient probabilistic context-free parsing algorithm that
computes prefix probabilities.
Computational Linguistics, 21 (2): 165–201,
1995.