Context-free grammar

Known as: Context-free grammars, CFG, Context Free Grammar

A context-free grammar (CFG) is a term used in formal language theory to describe a certain type of formal grammar. A context-free grammar is a set…

Papers overview

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

2004

OntoLearn is a system for word sense disambiguation, used to automat- ically enrich WordNet with domain concepts and to…

2004

The XML community generally takes trees and hedges as the model for XML document instances and element content. In contrast…

1999

This paper presents a grammatical and processing framework for handling the repairs, hesitations, and other interruptions in…

1997

Given a context free grammar (CFG) G and an integer n >= 0 we present an algorithm for generating strings derivable from the…

1996

This paper addresses the issue of whether functional categories head separate projections. In particular, Pollock (1989) claims…

1995

This paper presents a solution to the CFG Ambiguity Problem which has come about in a recent automatic language acquisition…

1993

Stochastic lexicalized context-free grammar (SLCFG) is an attractive compromise between the parsing efficiency of stochastic…

1992

This work is concerned with the way in which principled theories of syntax and modular theories of mind may participate in an…

1978

functors between the syntactical

1973

Normal form theorems which factor arbitrary phrase-structure grammars into context-free grammars and “a little more” are…