Indexed grammar

Known as: Linear indexed grammar, Linear-indexed grammar 
Indexed grammars are a generalization of context-free grammars in that nonterminals are equipped with lists of flags, or index symbols.The language… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1956-2017
010203019562016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Self-indexes aim at representing text collections in a compressed format that allows extracting arbitrary portions and also… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Extractors and taggers turn unstructured text into entity-relation(ER) graphs where nodes are entities (email, paper, person… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
  • LEONARD E. BAUM, J. A. EAGON
  • 2007
1. Summary. The object of this note is to prove the theorem below and sketch two applications, one to statistical estimation for… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
ion makes it possible to build non-recursive functions directly inside Calculus of Constructions terms, without giving a name to… (More)
  • figure 2.1
  • figure 3.1
  • figure 3.3
  • figure 4.1
  • figure 4.2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Signature les have been studied extensively as an access method for textual databases. Many approaches have been proposed for… (More)
  • figure 12
Is this relevant?
Highly Cited
1994
Highly Cited
1994
There is currently considerable interest among computational linguists in grammatical formalisms with highly restricted… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
In this paper we present a scheme to extend a recognition algorithm for Context-Free Grammars (CFG) that can be used to derive… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
1968
Highly Cited
1968
A new type of grammar for generating formal languages, called an indexed grammar, is presented. An indexed grammar is an… (More)
  • figure 1
Is this relevant?