Stuart M. Shieber
ABSTRACT
Native speakers of English show definite and consistent preferences for certain readings of syntactically ambiguous sentences. A user of a natural-language-processing system would naturally expect it to reflect the same preferences. Thus, such systems must model in some way the linguistic performance as well as the linguistic competence of the native speaker. We have developed a parsing algorithm---a variant of the LALR(1) shift-reduce algorithm---that models the preference behavior of native speakers for a range of syntactic preference phenomena reported in the psycholinguistic literature, including the recent data on lexical preferences. The algorithm yields the preferred parse deterministically, without building multiple parse trees and choosing among them. As a side effect, it displays appropriate behavior in processing the much discussed garden-path sentences. The parsing algorithm has been implemented and has confirmed the feasibility of our approach to the modeling of these phenomena.
- Aho, A. V. and S. C. Johnson, 1974: "LR Parsing." Computing Surveys, Volume 6, Number 2, pp. 99--124 (Spring). Google Scholar
Digital Library
- Ford, M., J. Bresnan, and R. Kaplan, 1982: "A Competence-Based Theory of Syntactic Closure," in The Mental Representation of Grammatical Relations, J. Bresnan, ed. (Cambridge, Massachusetts: MIT Press).Google Scholar
- Frazier, L., and J. D. Fodor, 1978: "The Sausage Machine: A New Two-Stage Parsing Model," Cognition, Volume 6, pp. 291--325.Google ScholarCross Ref
- Frazier, L., and J. D. Fodor, 1980: "Is the Human Sentence Parsing Mechanism an ATN?" Cognition, Volume 8, pp. 411--459.Google Scholar
- Gazdar, G., 1981: "Unbounded dependencies and coordinate structure," Linguistic Inquiry, Volume 12, pp. 165--179.Google Scholar
- Kimball, J., 1973: "Seven Principles of Surface Structure Parsing in Natural Language," Cognition, Volume 2, Number 1, pp. 15--47.Google Scholar
- Marcus, M., 1980: A Theory of Syntactic Recognition for Natural Language, (Cambridge, Massachusetts: MIT Press). Google ScholarDigital Library
- Pereira, F. C. N., forthcoming: "A New Characterization of Attachment Preferences," to appear in D. Dowty, L. Karttunen, and A. Zwicky (eds.) Natural Language Processing. Psycholinguistic, Computational, and Theoretical Perspectives, Cambridge, England: Cambridge University Press.Google Scholar
- Pereira, F.C.N., and S.M. Shieber, forthcoming: "Shift-Reduce Scheduling and Syntactic Closure," to appear.Google Scholar
- Wanner, E., 1980: "The ATN and the Sausage Machine: Which One is Baloney?" Cognition, Volume 8, pp. 209--225.Google ScholarCross Ref
- Sentence disambiguation by a shift-reduce parsing technique
Recommendations
Sentence disambiguation by a shift-reduce parsing technique
IJCAI'83: Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2Native speakers of English show definite and consistent preferences for certain readings of syntactically ambiguous sentences. A user of a natural-language-processing system would naturally expect it to reflect the same preferences. Thus, such systems ...
Shift-reduce CCG parsing
HLT '11: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1CCGs are directly compatible with binary-branching bottom-up parsing algorithms, in particular CKY and shift-reduce algorithms. While the chart-based approach has been the dominant approach for CCG, the shift-reduce method has been little explored. In ...
Deterministic shift-reduce parsing for unification-based grammars
Many parsing techniques assume the use of a packed parse forest to enable efficient and accurate parsing. However, they suffer from an inherent problem that derives from the restriction of locality in the packed parse forest. Deterministic parsing is ...
Comments