The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Transition network grammars for natural language analysis
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
ASPECTS OF THE THEORY OF SYNTAX
Chomsky, N. (1964) · doi:10.21236/ad0616323 · Cited by 13,587
Fillmore, C. J. (1967) · Cited by 2,781
Universals in Linguistic Theory
Brekle, H. E. (1970) · Indogermanische Forschungen · doi:10.1515/if-1970-0116 · Cited by 2,764
Handbook Of Mathematical Psychology
Galanter, & Eugène (1963) · Cited by 1,956
An efficient context-free parsing algorithm
Earley, J. (1983) · Communications of the ACM · doi:10.1145/357980.358005 · Cited by 1,606
The mathematical theory of context free languages
Ginsburg, S. (1966) · Cited by 959
On the translation of languages from left to right
Knuth, D. E. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90426-2 · Cited by 780
McCarthy, J., Abrahams, P. W., Edwards, D. J., Hart, T. P., & Levin, M. I. (1962) · doi:10.21236/ad0406138 · Cited by 555
Regular Expressions and State Graphs for Automata
McNaughton, R., & Yamada, H. (1960) · IEEE Transactions on Electronic Computers · doi:10.1109/tec.1960.5221603 · Cited by 519
Design of a separable transition-diagram compiler
Conway, M. E. (1963) · Communications of the ACM · doi:10.1145/366663.366704 · Cited by 437
Procedural semantics for a question-answering machine
Woods, W. A. (1968) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1476589.1476653 · Cited by 127
Self-citationA note on computing time for recognition of languages generated by linear grammars
Kasami, T. (1967) · Information and Control · doi:10.1016/s0019-9958(67)80008-1 · Cited by 24
Context-free language processing in time n3
Younger, D. H. (1966) · Annual Symposium on Switching & Automata Theory · doi:10.1109/swat.1966.7 · Cited by 22
(1965) · Defense Technical Information Center (DTIC)
Cited by
Statecharts: a visual formalism for complex systems
Harel, D. (1987) · Science of Computer Programming · doi:10.1016/0167-6423(87)90035-9 · Cited by 6,751
Strategies of Discourse Comprehension
Staczek, J. J., van Dijk, T. A., & Kintsch, W. (1985) · The Modern Language Journal · doi:10.2307/326517 · Cited by 5,395
The sausage machine: A new two-stage parsing model
Frazier, L., & Fodor, J. D. (1978) · Cognition · doi:10.1016/0010-0277(78)90002-1 · Cited by 1,400
The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty
Erman, L. D., Hayes-Roth, F., Lesser, V. R., & Reddy, D. R. (1980) · ACM Computing Surveys · doi:10.1145/356810.356816 · Cited by 1,357
Establishing and maintaining long-term human-computer relationships
Bickmore, T. W., & Picard, R. W. (2005) · ACM Transactions on Computer-Human Interaction · doi:10.1145/1067860.1067867 · Cited by 1,333
Metadata
- Authors
- Woods, W. A.
- Venue
- Communications of the ACM
- Published
- 1970-10
- Volume
- 13
- Issue
- 10
- Pages
- 591-606
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2035032881
- Cited by
- 1,323
- References
- 14
- FWCI
- 27.76
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.