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.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Two strategies of parallel adjoining of contexts are considered for contextual grammars with choice. After a short comparison between them, there are provided Chomsky-Schutzenberger type characterizations of context-free and recursively enumerable languages. Finally, we discuss some decision problems.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.