Phrase-Structure Grammars: Normal Forms and Reduction

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F16%3APU121556" target="_blank" >RIV/00216305:26230/16:PU121556 - isvavai.cz</a>
Result on the web
<a href="https://www.fit.vut.cz/research/publication/9949/" target="_blank" >https://www.fit.vut.cz/research/publication/9949/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1093/comjnl/bxw001" target="_blank" >10.1093/comjnl/bxw001</a>

Result language
angličtina
Original language name
Phrase-Structure Grammars: Normal Forms and Reduction
Original language description
This paper establishes two new normal forms for phrase-structure grammars in which both context-free rules and non-context-free rules are in prescribed forms. In addition, a limit is placed on the number of context-free rules. More specifically, the first form has 2 + n context-free rules, where n is the number of terminals. Concerning non-context-free rules, each of them has the form AB -> CD, where A, B, C, D are nonterminals. The second normal form has always only two context-free rules---S -> S# and # -> e, where S is the start symbol, # is a nonterminal, and e is the empty string. Regarding non-context-free rules, each of them is of the form AB -> XD, where A, B, D are nonterminals and X is a nonterminal or a terminal.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/TE01020415" target="_blank" >TE01020415: V3C - Visual Computing Competence Center</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)