Temat: regulated grammars - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: New Grammar Systems and Their Application Perspectives
Autorzy:: Horáček, Petr
Meduna, Alexander
Powiązania:: https://bibliotekanauki.pl/articles/1373727.pdf
Data publikacji:: 2013
Wydawca:: Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:: synchronous grammars
regulated grammars
transducers
computational control
generative power
natural language translation
Opis:: This paper presents new grammar systems that describe transformations of syntactic structures. They represent two approaches: synchronous grammars and transducers. The systems consist of well-known models such as context-free grammars and finite automata. Particular attention is paid to synchronization of regulated grammars. The paper recalls formal definitions of the systems and discusses theoretical results regarding their generative and accepting power. The last part briefly introduces application perspectives in natural language translation, illustrated by examples of Czech-English translation.
Źródło:: Schedae Informaticae; 2013, 22; 47-68
0860-0295
2083-8476
Pojawia się w:: Schedae Informaticae
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Parsing based on n-path tree - controlled grammars
Autorzy:: Čermák, M.
Koutný, J.
Meduna, A.
Powiązania:: https://bibliotekanauki.pl/articles/375747.pdf
Data publikacji:: 2011
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: regulated rewriting
derivation tree
tree-controlled grammars
path-controlled grammars
parsing
n-path tree-controlled grammars
Opis:: This paper discusses recently introduced kind of linguistically motivated restriction placed on tree-controlled grammars-context-free grammars with some root-to-leaf paths in their derivation trees restricted by a control language. We deal with restrictions placed on n greater-than or equal to 1 paths controlled by a deterministic context-free language, and we recall several basic properties of such a rewriting system. Then, we study the possibilities of corresponding parsing methods working in polynomial time and demonstrate that some non-context-free languages can be generated by this regulated rewriting model. Furthermore, we illustrate the syntax analysis of LL grammars with controlled paths. Finally, we briefly discuss how to base parsing methods on bottom-up syntax-analysis.
Źródło:: Theoretical and Applied Informatics; 2011, 23, 3-4; 213-228
1896-5334
Pojawia się w:: Theoretical and Applied Informatics
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja