Results 111 to 120 of about 169,488 (224)
Traditional parser generators are designed to produce highly optimised parsers for grammars known in their entirety ahead of time. There are some circumstances where it is desirable to construct a parser from grammar fragments, for which the flexibility of combination is more important than the speed of the final parser.
openaire +1 more source
A dataset of Curie and Néel temperatures auto-generated with ChemDataExtractor and the Snowball algorithm. [PDF]
Kelly CR, Cole JM.
europepmc +1 more source
Dependency-aware self-attention for robust neural machine translation. [PDF]
Chi C, Li F, Liu Y, Xie P, Yan H.
europepmc +1 more source
Parsing GTF and FASTA files using the eccLib Library. [PDF]
Chady T, Filutowska ZK.
europepmc +1 more source
A comparative study of Arabic syntactic analyzers. [PDF]
Saadiyeh O +3 more
europepmc +1 more source
Risky or rigorous? Developing trustworthiness criteria for AI-supported qualitative data analysis. [PDF]
Lazarus MD +4 more
europepmc +1 more source
Flexor Carpi Radialis and Dorsal Intercarpal Complex Elongation After 3 Ligament Tenodesis. [PDF]
Bakker D +6 more
europepmc +1 more source
LLM-as-a-Judge: automated evaluation of search query parsing using large language models. [PDF]
Baysan MS +4 more
europepmc +1 more source
EC2Seq2Sql: Patient-trial matching with LLM agents. [PDF]
Yang L +6 more
europepmc +1 more source

