by Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimozono, Kouichi Hirata
http://dumbo.ai.kyutech.ac.jp/~hirata/papers/ICGI2000.ps.gz
Add To MetaCart
Abstract:
Abstract. A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and investigate query learning of CFGs with the help of subpansive trees. We show a restricted class of CFGs, which we call hierarchical CFGs, is e#ciently learnable, while it is unlikely to be polynomial-time predictable. 1
Citations
|
2771
|
Introduction to Automata Theory, Languages and Computation
– Hopcroft, Ullman
- 1979
|
|
638
|
Aspects of the Theory of Syntax
– Chomsky
- 1965
|
|
627
|
Language identification in the limit
– Gold
|
|
529
|
Queries and concept learning
– Angluin
- 1988
|
|
511
|
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
– Littlestone
- 1988
|
|
370
|
Learning regular sets from queries and counterexamples
– Angluin
- 1987
|
|
320
|
Lectures on government and binding
– Chomsky
- 1981
|
|
247
|
Syntactic structures
– Chomsky
- 1957
|
|
157
|
Language learnability and language development
– Pinker
- 1984
|
|
71
|
Efficient learning of context-free grammars from positive structural examples
– Sakakibara
- 1992
|
|
42
|
Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science 76.223–242
– SAKAKIBARA
- 1990
|
|
31
|
Characteristic sets for polynomial grammatical inference
– Higuera
- 1997
|
|
19
|
Specifiers and projection
– Fukui, Speas
- 1986
|
|
17
|
Learning one-counter languages in polynomial time
– BERMAN, ROOS
- 1987
|
|
14
|
Polynomial time learnability of simple deterministic languages
– Ishizaka
- 1990
|
|
10
|
Learning k-bounded context-free grammars
– Angluin
- 1987
|
|
10
|
On the structural grammatical inference problem for some classes of context-free grammars
– Makinen
- 1992
|
|
8
|
Remarks on nominalization. Readings in English transformational grammar
– CHOMSKY
- 1970
|
|
8
|
X syntax: A study of phrase structure
– Jackendo
- 1977
|
|
7
|
Learning and inventing of horn clause theories - a constructive method
– Ling
- 1989
|
|
6
|
Lloyd: Foundations of Logic Programming, second edition
– W
- 1987
|
|
6
|
Prediction preserving reduction
– Pitt, Warmuth
- 1990
|
|
6
|
Language learning from membership queries and characteristic examples
– Sakamoto
- 1995
|
|
5
|
Formal properties of grammars, Handbook of mathematical psychology
– Chomsky
- 1963
|
|
3
|
Ishizaka: Constructive learning of translations based on dictionaries
– Sugimoto, Hirata, et al.
- 1996
|
|
2
|
Introduction to linguistic theory and natural language acquisition
– Crain, Lillo-Martin
- 1999
|
|
2
|
The query complexity of learning some subclasses of context-free grammars
– Domingo, Lavn
- 1995
|
