Topic
Immediate constituent analysis
About: Immediate constituent analysis is a research topic. Over the lifetime, 100 publications have been published within this topic receiving 3368 citations. The topic is also known as: IC analysis.
Papers published on a yearly basis
Papers
TL;DR: A sequence of restrictions that limit grammars first to Turing machines, then to two types of system from which a phrase structure description of the generated language can be drawn, and finally to finite state Markov sources are shown to be increasingly heavy.
Abstract: A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequence of restrictions that limit grammars first to Turing machines, then to two types of system from which a phrase structure description of the generated language can be drawn, and finally to finite state Markov sources (finite automata). These restrictions are shown to be increasingly heavy in the sense that the languages that can be generated by grammars meeting a given restriction constitute a proper subset of those that can be generated by grammars meeting the preceding restriction. Various formulations of phrase structure description are considered, and the source of their excess generative power over finite state sources is investigated in greater detail.
1,611 citations
TL;DR: It is given that every context-free phrase structure generator is strongly equivalent to one in standard form and offers an independent proo[' of a variant of the Chomsky-Setditzenberger 1tortoni form theorem.
Abstract: A context>free phrase structure general~or is in..~landard jb~'m if and only if alt of its rules are of the form: Z-, aY~, ... , Y,~ where Z and Yi are intermediate symbels and a is a l~erminM symbol, so that one input., symbol is processed at each step. Standard form is eonvenien(~ for computer manipulation of eontext-free languages. A proof is given that every context-free phrase structure generator is strongly equivalent to one in standard form; it, is in the form of an algorithm now being prograrr~med, and offers an independent proo[' of a variant of the Chomsky-Setditzenberger 1tortoni form theorem.
307 citations
18 Mar 2001
TL;DR: This work not only provides ways to convert Treebanks from one type of representation to the other, but also clarifies the differences in representational coverage of the two approaches.
Abstract: Treebanks are of two types according to their annotation schemata: phrase-structure Treebanks such as the English Penn Treebank [8] and dependency Treebanks such as the Czech dependency Treebank [6]. Long before Treebanks were developed and widely used for natural language processing, there had been much discussion of comparison between dependency grammars and context-free phrase-structure grammars [5]. In this paper, we address the relationship between dependency structures and phrase structures from a practical perspective; namely, the exploration of different algorithms that convert dependency structures to phrase structures and the evaluation of their performance against an existing Treebank. This work not only provides ways to convert Treebanks from one type of representation to the other, but also clarifies the differences in representational coverage of the two approaches.
144 citations
TL;DR: It is reported that finite-state grammars can be learned by non-human primates, whereas phrase-structure Grammars cannot, and the question arises as to whether the distinction between these two types of grammARS finds its reflection in different neural systems within the human brain.
127 citations
109 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 1 |
| 2017 | 3 |
| 2016 | 2 |
| 2015 | 4 |
| 2014 | 4 |
| 2013 | 2 |