Results 251 to 260 of about 859,079 (303)
Some of the next articles are maybe not open access.
Grounding Language Model with Chunking-Free In-Context Retrieval
Annual Meeting of the Association for Computational LinguisticsThis paper presents a novel Chunking-Free In-Context (CFIC) retrieval approach, specifically tailored for Retrieval-Augmented Generation (RAG) systems. Traditional RAG systems often struggle with grounding responses using precise evidence text due to the
Hongjin Qian +4 more
semanticscholar +1 more source
Logics for context-free languages
1995We define matchings, and show that they capture the essence of context-freeness. More precisely, we show that the class of context-free languages coincides with the class of those sets of strings which can be defined by sentences of the form ∃ bϕ, where ϕ is first order, b is a binary predicate symbol, and the range of the second order quantifier is ...
Clemens Lautemann +2 more
openaire +1 more source
On stochastic context-free languages
Information Sciences, 1971In this paper, properties of normalized stochastic languages are discussed and alternative procedures for constructing the Chomsky and Greibach normal forms for normalized stochastic context-free grammar (nscfg) are presented. A normalized stochastic context-free language (nscf l) is defined in terms of a nscfg.
T. Huang, King-Sun Fu
openaire +3 more sources
A baseline method for compiling typed unification grammars into context free language models
Interspeech, 2001This paper presents a minimal enumerative approach to the problem of compiling typed unification grammars into CFG language models, a prototype implementation and results of experiments in which it was used to compile some non-trivial unification ...
Manny Rayner +2 more
semanticscholar +1 more source
On intersections of context-free languages
Fundamenta Informaticae, 1980Following the suggestion of Prof. S. Marcus we study the “Darboux properties” of the hierarchy of intersections of context-free languages, introduced by Liu and Weiner [5]. Some properties of the Parikh function defined on an intersection of context-free languages are infered.
openaire +3 more sources
Circuits and Context-Free Languages
1999Simpler proofs that DAuxPDA-TIME(polynomial) equals LOG(DCFL) and that SAC1 equals LOG(CFL) are given which avoid Sud-borough's multi-head automata [Sud78]. The first characterization of LOGDCFL in terms of polynomial proof-tree-size is obtained, using circuits built from the multiplex select gates of [FLR96].
Pierre McKenzie +2 more
openaire +1 more source
On the recognition of context-free languages
1985In this paper we present two results concerning the time and space complexity of context-free recognition. The first result states that cfl's can be recognized on a cube-connected computer (CCC) or on a perfect-shuffle computer (PSC) in log2n time using n6 processors.
openaire +2 more sources
On context-free and Szilard languages
BIT, 1984The Szilard language of a context-free grammar is context-free if and only if the grammar is ''half-bounded'', i.e. if there is a natural number k such that each sentential form contains at most k occurrences of all but possibly one nonterminal. However, it is quite natural to expect that also non-context-free Szilard languages of context-free grammars
openaire +2 more sources
Caterpillars and context-free languages
1990We use the concept of a caterpillar tree to study the properties of context-free languages, in particular new results about the index of context-free languages and the recognition of context-free languages are obtained this way. The first group of results points to differences between ambiguous and unambiguous languages.
Michal Chytil, Burkhard Monien
openaire +1 more source
InfLLM: Training-Free Long-Context Extrapolation for LLMs with an Efficient Context Memory
Neural Information Processing SystemsLarge language models (LLMs) have emerged as a cornerstone in real-world applications with lengthy streaming inputs (e.g., LLM-driven agents). However, existing LLMs, pre-trained on sequences with a restricted maximum length, cannot process longer ...
Chaojun Xiao +8 more
semanticscholar +1 more source