Search
Now showing items 1-8 of 8
Unification and Grammatical Theory
(Cascadilla Press, 1986)
This paper informally presents a new view of grammar that has emerged from a number of distinct but related lines of investigation in theoretical and computational linguistics. Under this view, many current linguistic ...
A uniform architecture for parsing and generation
(Association for Computational Linguistics, 1988)
The use of a single grammar for both parsing and generation is an idea with a certain elegance, the desirability of which several researchers have noted. In this paper, we discuss a more radical possibility: not only can ...
The semantics of grammar formalisms seen as computer languages
(Association for Computational Linguistics, 1984)
The design, implementation, and use of grammar formalisms for natural language have constituted a major branch of computational linguistics throughout its development. By viewing grammar formalisms as just a special case ...
Criteria for Designing Computer Facilities for Linguistic Analysis
(Walter de Gruyter, 1985)
Abstract: In the natural-language-processing research community, the usefulness of computer tools for testing linguistic analyses is often taken for granted. Linguists, on the other hand, have generally been unaware of or ...
Formal constraints on metarules
(Association for Computational Linguistics, 1983)
Metagrammatical formalisms that combine context-free phrase structure rules and metarules (MPS grammars) allow concise statement of generalizations about the syntax of natural languages. Unconstrained MPS grammars, ...
The Formalism and Implementation of PATR-II
(SRI International, 1983)
Using restriction to extend parsing algorithms for complex-feature-based formalisms
(Association for Computational Linguistics, 1985)
Grammar formalisms based on the encoding of grammatical information in complex-valued feature systems enjoy some currency both in linguistics and natural-language-processing research. Such formalisms can be thought of by ...
An algorithm for generating quantifier scopings
(Association for Computing Machinery, 1987)
The syntactic structure of a sentence often manifests quite clearly the predicate-argument structure and relations of grammatical subordination. But scope dependencies are not so transparent. As a result, many systems for ...