Abstract
The use of augmented transition network grammars for the analysis of natural language sentences is described. Structure-building actions associated with the arcs of the grammar network allow for the reordering, restructuring, and copying of constituents necessary to produce deep-structure representations of the type normally obtained from a transformational analysis, and conditions on the arcs allow for a powerful selectivity which can rule out meaningless analyses and take advantage of semantic information to guide the parsing. The advantages of this model for natural language analysis are discussed in detail and illustrated by examples. An implementation of an experimental parsing system for transition network grammars is briefly described.
Keywords
Computer scienceParsingRule-based machine translationNatural language processingArtificial intelligencePhrase structure grammarNatural languageProgramming languageContext-free grammar
Affiliated Institutions
Related Publications
Recurrent Neural Network Grammars
We introduce recurrent neural network grammars, probabilistic models of sentences with explicit phrase structure. We explain efficient inference procedures that allow applicatio...
Generating Typed Dependency Parses from Phrase Structure Parses
This paper describes a system for extracting typed dependency parses of English sentences from phrase structure parses. In order to capture inherent relations occurring in corpu...
ASPECTS OF THE THEORY OF SYNTAX
Abstract : Contents: Methodological preliminaries: Generative grammars as theories of linguistic competence; theory of performance; organization of a generative grammar; justifi...
Parsing Natural Scenes and Natural Language with Recursive Neural Networks
Recursive structure is commonly found in the inputs of different modalities such as natural scene images or natural language sentences. Discovering this recursive structure help...
Learning to Map Sentences to Logical Form: Structured Classification with Probabilistic Categorial Grammars
This paper addresses the problem of mapping natural language sentences to lambda-calculus encodings of their meaning. We describe a learning algorithm that takes as input a trai...
Publication Info
- Year
- 1970
- Type
- article
- Volume
- 13
- Issue
- 10
- Pages
- 591-606
- Citations
- 1326
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1326
OpenAlex
Cite This
William A. Woods
(1970).
Transition network grammars for natural language analysis.
Communications of the ACM
, 13
(10)
, 591-606.
https://doi.org/10.1145/355598.362773
Identifiers
- DOI
- 10.1145/355598.362773