ACM Computing Surveys (CSUR)
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
An efficient augmented-context-free parsing algorithm
Computational Linguistics
Using multiple knowledge sources for word sense discrimination
Computational Linguistics
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Computational Linguistics - Special issue on using large corpora: I
Deterministic parsing and unbounded dependencies
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Syntactic and semantic parsability
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Control structures and theories of interaction in speech understanding systems
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Conceptual analysis of garden-path sentences
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Resolving a pragmatic prepositional phrase attachment ambiguity
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Gemini: a natural language system for spoken-language understanding
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
A competition-based explanation of syntactic attachment preferences and garden path phenomena
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Japanese sentence analysis as argumentation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A uniform architecture for parsing and generation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Fast LR parsing using rich (Tree Adjoining) Grammars
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
An efficient LR parser generator for tree-adjoining grammars
New developments in parsing technology
Algorithms for deterministic incremental dependency parsing
Computational Linguistics
Phrase structure grammars and natural languages
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
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.