# Terminal and nonterminal symbols

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Theor. Comput. Sci.
- 2011

This paper studies the nonterminal complexity of tree controlled grammars. It is proved that the number of nonterminals in tree… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- EMNLP
- 2008

We formulate dependency parsing as a graphical model with the novel ingredient of global constraints. We show how to apply loopy… (More)

Is this relevant?

2008

2008

- EMNLP
- 2008

This paper proposes a novel maximum entropy based rule selection (MERS) model for syntax-based statistical machine translation… (More)

Is this relevant?

2007

2007

- ACM Trans. Algorithms
- 2007

Given an undirected graph <i>G</i>(<i>V</i>, <i>E</i>) with terminal set <i>T</i> ⊆ <i>V</i>, the problem of packing element… (More)

Is this relevant?

2002

2002

- ICGI
- 2002

pcfg Learning by Partition Search is a general grammatical inference method for constructing, adapting and optimising pcfgs… (More)

Is this relevant?

2000

2000

- Theor. Comput. Sci.
- 2000

This paper discusses the descriptional complexity of scattered context grammars with respect to the number of nonterminals. It… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- 1993

We present a new algorithm, Prioritized Sweeping, for e cient prediction and control of stochastic Markov systems. Incremental… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- COLING
- 1992

In this paper, I argue for the use of a probabilistic form of tree-adjoining grammar (TAG) in statistical natural language… (More)

Is this relevant?

1989

1989

- Pattern Recognition Letters
- 1989

This paper deals with the decision rules of a multistage classifier based on a decision tree scheme. Two optimal (Bayes… (More)

Is this relevant?

Highly Cited

1968

Highly Cited

1968

- Mathematical systems theory
- 1968

“Meaning” may be assigned to a string in a context-free language by defining “attributes” of the symbols in a derivation tree for… (More)

Is this relevant?