FAQ

Controlled grammar

Controlled grammars are a class of grammars that extend, usually, the context-free grammars with additional controls on the derivations of a sentence… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1964-2017
05101519642017

Related topics

Related topics

5 relations
Context-free grammarHasse diagramIndexed grammarMatrix grammar
(More)

Related mentions per year

Related mentions per year

1952-2018
1960198020002020
Controlled grammar
Context-free grammar
Transformational grammar
Hasse diagram
Indexed grammar
Matrix grammar

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
From Observational Studies to Causal Rule Mining
Randomised controlled trials (RCTs) are the most effective approach to causal discovery, but in many circumstances it is… (More)
  • figure 1
  • table I
  • table II
  • table III
  • table IV
Is this relevant?
2013
2013
Human-Swarm Interaction: An Experimental Study of Two Types of Interaction with Foraging Swarms
In this paper we present the first study of human-swarm interaction comparing two fundamental types of interaction, coined… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2012
2012
Traffic Instabilities in Self-Organized Pedestrian Crowds
In human crowds as well as in many animal societies, local interactions among individuals often give rise to self-organized… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Adaptor Grammars: A Framework for Specifying Compositional Nonparametric Bayesian Models
This paper introduces adaptor grammars, a class of probabilistic models of language that generalize probabilistic context-free… (More)
  • figure 1
Is this relevant?
1995
1995
Automatic Generation of Visual Programming Environments
Computer raphical operating environments have made computer-human interaction straightforward, pleasant, and intuitive. And the G… (More)
  • figure 4
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
1994
1994
Lexicalization and Grammar Development
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Lambek Grammars Are Context Free
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are context free. Introduction… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Generalized Probabilistic LR Parsing of Natural Language (Corpora) with Unification-Based Grammars
We describe work toward the construction of a very wide-coverage probabilistic parsing system for natural language (NL), based on… (More)
  • figure 1
  • figure 2
  • figure 6
  • table 1
  • table 2
Is this relevant?
1980
1980
Restrictions, extensions, and variations of NLC grammars
This paper continues the basic research on node-label-controlled graph grammars (NLC gmmnars). In particular three topics are… (More)
Is this relevant?
Highly Cited
1971
Highly Cited
1971
Simple LR(k) Grammars
A class of context-free grammars, called the “Simple <italic>LR</italic>(<italic>k</italic>)” or <italic>SLR</italic>(<italic>k… (More)
  • figure 2
  • table I
Is this relevant?