Jonathan Slocum
- Aho, A. V., and J. D. Ullman. The Theory of Parsing, Translation, and Compiling, Vol. 1. Prentice-Hall, Englewood Cliffs, New Jersey, 1972. Google Scholar
Digital Library
- Burton, R. R., "Semantic Grammar: An engineering technique for constructing natural language understanding systems," BBN Report 3453, Bolt, Beranek, and Newman, Inc., Cambridge, Mass., Dec. 1976.Google Scholar
- Chester, D., "A Parsing Algorithm that Extends Phrases," AJCL 6 (2), April-June 1980, pp. 87--96. Google ScholarDigital Library
- Earley, J., "An Efficient Context-free Parsing Algorithm," CACM 13 (2), Feb. 1970, pp. 94--102. Google ScholarDigital Library
- Graham, S. L., M. A. Harrison, and W. L. Ruzzo, "An Improved Context-Free Recognizer," ACM Transactions on Programming Languages and Systems, 2 (3), July 1980. pp. 415--462. Google ScholarDigital Library
- Griffiths, T. V., and S. R. Petrick, "On the Relative Efficiencies of Context-free Grammar Recognizers," CACM 8 (5), May 1965, pp. 289--300. Google ScholarDigital Library
- Hendrix, G. G., "Human Engineering for Applied Natural Language Processing," Proceedings of the 5th International Conference on Artificial Intelligence, Cambridge, Mass., Aug. 1977.Google Scholar
- Hendrix, G. G., E. D. Sacardoti, D. Sagalowicz, and J. Slocum, "Developing a Natural Language Interface to Complex Data," ACM Transactions on Database Systems, 3 (2), June 1978, pp. 105--147. Google ScholarDigital Library
- Lehmann, W. P., W. S. Bennett, J. Slocum, et al., "The METAL System," Final Technical Report RADC-TR-80-374. Rome Air Development Center, Griffiss AFB, New York, Jan. 1981. Available from NTIS.Google Scholar
- Paxton, W. H., "A Framework for Speech Understanding," Tech. Note 142, AI Center, SRI International, Menlo Park, Calif., June 1977.Google Scholar
- Pratt, V. R., "LINGOL: A progress report," Proceedings of the Fourth International Joint Conference on Artificial Intelligence, Tbilisi, Georgia, USSR, 3--8 Sept. 1975, pp. 422--428.Google Scholar
- Robinson, J. J., "DIAGRAM: A grammar for dialogues," Tech. Note 205, AI Center, SRI International, Menlo Park, Calif., Feb. 1980.Google Scholar
- Sacerdoti, E. D., "Language Access to Distributed Data with Error Recovery," Proceedings of the Fifth International Joint Conference on Artificial Intelligience, Cambridge, Mass., Aug. 1977.Google Scholar
- Slocum, J., An Experiment in Machine Translation," Proceedings of the 18th Annual Meeting of the Association for Computational Linguistics, Philadelphia, 19--22 June 1980, pp. 163--167. Google ScholarDigital Library
- Walker, D. E. (ed.). Understanding Spoken Language. North-Holland, New York, 1978. Google ScholarDigital Library
- Woods, W. A., "Syntax, Semantics, and Speech," BBN Report 3067, Bolt, Beranek, and Newman, Inc., Cambridge, Mass., Apr. 1975.Google Scholar
- A practical comparison of parsing strategies
Recommendations
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars
COLING '88: Proceedings of the 12th conference on Computational linguistics - Volume 2In this paper we present a general parsing strategy that arose from the development of an Earley-type parsing algorithm for TAGs (Schabes and Joshi 1988) and from recent linguistic work in TAGs (Abeille 1988).In our approach elementary structures are ...
Parsing expression grammars made practical
SLE 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language EngineeringParsing Expression Grammars (PEGs) define languages by specifying a recursive-descent parser that recognises them. The PEG formalism exhibits desirable properties, such as closure under composition, built-in disambiguation, unification of syntactic and ...
LLLR parsing
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied ComputingThe idea of an LLLR parsing is presented. An LLLR(k) parser can be constructed for any LR(k) grammar but it produces the left parse of the input string in linear time (in respect to the length of the derivation) without backtracking. If used as a basis ...
Comments