Results 261 to 270 of about 14,474 (287)

LLM-AIx: An open source pipeline for Information Extraction from unstructured medical text based on privacy preserving Large Language Models

Wiest IC, Wolf F, Leßmann M, van Treeck M, Ferber D, Zhu J, Boehme H, Bressem KK, Ulrich H, Ebert MP, Kather JN.   +10 more
europepmc   +1 more source

Automated generation of discharge summaries: leveraging large language models with clinical data. [PDF]

Sci Rep
Ganzinger M, Kunz N, Fuchs P, Lyu CK, Loos M, Dugas M, Pausch TM.   +6 more
europepmc   +1 more source

Visual Modeling Languages in Patient Pathways: Scoping Review.

Interact J Med Res
Bogale B, Vesinurm M, Lillrank P, Celius EG, Halvorsrud R.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Generalized context‐free grammars and multiple context‐free grammars

Systems and Computers in Japan, 1989
AbstractIt is shown that the class of languages generated by generalized context‐free grammars (gcfg's) introduced by Pollard is exactly the class of recursively enumerable sets. Next, a subclass of gcfg's called multiple context‐free grammars (mcfg's) is introduced and it is shown that the class of languages generated by mcfg's properly contains the ...
Hiroyuki Seki, Tadao Kasami, Mamoru Fujii   +2 more
openaire   +2 more sources

Context-Free Grammars

2016
In this chapter the authors introduce context-free grammars, and they explain grammars for expressions.
Wolfgang J. Paul, Petro Lutsyk, Christoph Baumann, Sabine Schmaltz   +3 more
openaire   +2 more sources

Context-free grammars

2019
Context-free grammars represent language-generating rewriting systems. Each of their rewriting rules has a single symbol on its left-hand sides. By repeatedly applying these rules, these grammars generate sentences of their languages. This chapter gives a mathematical introduction into context-free grammars.
Petr Horacek, Alexander Meduna, Martin Tomko   +2 more
openaire   +2 more sources

Pullback Grammars Are Context-Free

2008
Following earlier work on pullback rewriting, we describe here the notion of graph grammar relevant to our formalism. We then show that pullback grammars are context-free and provide a surprising example, namely the context-free generation of square grids.
Ly, Olivier, Chen, Rui, Bauderon, Michel
openaire   +3 more sources

Context-Free Categorical Grammars

2009
We define generic categorical notions of rewriting and grammar, using two basic operations, pullback and pushout, and show that these categorical grammars are intrinsically context-free in the sense of Courcelle. We then specialise to various settings, including classical word grammars, hyperedge replacement grammars or node-replacement grammars.
Ly, Olivier, Bauderon, Michel, Chen, Rui
openaire   +3 more sources

Context-Free Grammars

2011
In the compilation of source programs, the second phase of the process is the syntactical analysis. Based on the lexical analysis, the syntactical analysis checks the correctness of the source programs in terms of the grammar of the language used. And it is well-known that most of the properties of the programming languages are context-free. Therefore,
Yunlin Su, Song Y. Yan
openaire   +2 more sources