Semantic Scholar uses AI to extract papers important to this topic.
Given that context-free grammars (CFG) cannot adequately describe natural languages, grammar formalisms beyond CFG that are still… Expand In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing context-free grammars (CFGs), yielding the… Expand We describe a parsing system based upon a language model for English that is, in turn, based upon assigning probabilities to… Expand This chapter is devoted to context-free languages. Context-free languages and grammars were designed initially to formalize… Expand We develop a formal grammatical system called a link grammar, show how English grammar can be encoded in such a system, and give… Expand Basic categorial grammars are the context-free ones. Another kind of categorial grammars was introduced by J. Lambek (1958… Expand Abstract Multiple context-free grammars (mcfg's) is a subclass of generalized context-free grammars introduced by Pollard (1984… Expand A new type of grammar for generating formal languages, called an indexed grammar, is presented. An indexed grammar is an… Expand In this report, certain properties of context-free (CF or type 2) grammars are investigated, like that of Chomsky. In particular… Expand 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… Expand