Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Stephan Kepser"'
Autor:
Fritz Hamm, Stephan Kepser
The contributions collected in this voume address central topics in theoretical and computational linguistics, such as quantification, types of context dependence and aspects concerning the formalisation of major grammatical frameworks, among others
Autor:
Stephan Kepser, Marga Reis
The renaissance of corpus linguistics and promising developments in experimental linguistic techniques in recent years have led to a remarkable revival of interest in issues of the empirical base of linguistic theory in general, and the status of dif
Autor:
Stephan Kepser, James Rogers
Publikováno v:
Journal of Logic, Language and Information. 20:361-384
The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these grammar formalisms. Non-strict tree adjoining grammars
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::666638fa7b7b7186d454c02ae90de710
https://doi.org/10.1007/s10849-011-9134-0
https://doi.org/10.1007/s10849-011-9134-0
Autor:
Stephan Kepser, Hans Joerg Tiede
Publikováno v:
Electronic Notes in Theoretical Computer Science. 165:189-199
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical formalisms. The central tool for model theoretic syntax has been monadic s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96e6b858c9a08655bdcc56c63b8c1178
Autor:
Uwe Mönnich, Stephan Kepser
Publikováno v:
Theoretical Computer Science. 354(1):82-97
Context-free tree grammars, originally introduced by Rounds [Math. Systems Theory 4(3) (1970) 257–287], are powerful grammar devices for the definition of tree languages. The properties of the class of context-free tree languages have been studied
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::776144c66476cdea725133cae6333bc9
Autor:
Stephan Kepser
Publikováno v:
Journal of Logic, Language and Information. 13:457-470
In recent years large amounts of electronic texts have become available. While the first of these corpora had only a low level of annotation, the more recent ones are annotated with refined syntactic information. To make these rich annotations access
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf9371c7f87eb410cc426ddaa66548e2
https://doi.org/10.1007/s10849-004-2116-8
https://doi.org/10.1007/s10849-004-2116-8
Autor:
Klaus U. Schulz, Stephan Kepser
Publikováno v:
Theoretical Computer Science. 266(1-2):113-157
In two earlier papers (Baader, Schulz, in: U. Montanari, F. Rossi (Eds.), Proc. CP'95 Springer Lecture Notes in Computer Science, vol. 976, Springer, Berlin, pp. 380-397; Theoret. Comput. Sci 192 (1998) 107-161), the concept of "free amalgamation" ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::473ec0dc641da2ccd7d04eb1c75d72b2
Autor:
James Rogers, Stephan Kepser
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642143212
The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these grammar formalisms. Non-strict tree adjoining grammars
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3328cc0acd2b4489528c761e72ae0faa
https://doi.org/10.1007/978-3-642-14322-9_11
https://doi.org/10.1007/978-3-642-14322-9_11
Autor:
Stephan Kepser
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642143212
MOL
MOL
Multidominance structures were introduced by Kracht [4] to provide a data structure for the formalisation of various aspects of GB-Theory. Kracht studied the PDL-theory of MDSes and showed that this theory is decidable in [5], actually 2EXPTIME-compl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6655a3b3cd15ca1afe30613b709b84b0
https://doi.org/10.1007/978-3-642-14322-9_10
https://doi.org/10.1007/978-3-642-14322-9_10
Publikováno v:
Linguistic Modeling of Information and Markup Languages ISBN: 9789048133307
In this contribution we propose a query method for XML documents that provides a well chosen balance between expressive power of the query language and query complexity using methods derived from logic. Since XML documents are basically regular tree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0eb36f94e5bc2bfb3d878f603f66674c
https://doi.org/10.1007/978-90-481-3331-4_13
https://doi.org/10.1007/978-90-481-3331-4_13