Abstract
A variant of contextual grammars, namely the total contextual grammar with restricted choice, is studied from several points of view. The results obtained by comparing this concept with other related types of contextual grammars support the claim that total contextual grammars with restricted choice are a generative model with good enough qualities for applications in the field of computational linguistics.