Results 1 to 10 of about 1,698 (255)
Building Domain Specific Languages for Voice Recognition Applications [PDF]
This paper presents a method of implementing the voice recognition for the control of software applications. The solutions proposed are based on transforming a subset of the natural language in commands recognized by the application using a formal ...
Cristian IONITA
doaj
Context-free grammars (CFGs) provide an intuitive and powerful formalism for describing the syntactic structure of parsable input streams. Unfortunately, existing online parsing algorithms for such streams admit only a subset of possible CFG descriptions.
openaire +2 more sources
Abstract families of context-free grammars
An abstract family of grammars (AFG) may be defined as a class of grammars for which the corresponding class of languages forms an abstract family of languages (AFL) as defined by Ginsburg and Greibach. The derivation bounded grammars of Ginsburg and Spanier is an example of an AFG which is properly included in the class of all context-free grammars ...
openaire +4 more sources
Weighted and Probabilistic Context-Free Grammars Are Equally Expressive
Noah A. Smith, Mark Johnson
doaj +1 more source
Evolving stochastic context--free grammars for RNA secondary structure prediction. [PDF]
Wj Anderson J +4 more
europepmc +1 more source
Parsing social network survey data from hidden populations using stochastic context-free grammars. [PDF]
Poon AF +7 more
europepmc +1 more source
A symbolic dataset for large language models to solve second kind Fredholm integral equations. [PDF]
Dana Mazraeh H +3 more
europepmc +1 more source
Deciphering the linguistic blueprint of DNA: context-sensitive structures, statistical patterns, and regulatory implications. [PDF]
Akhmetov I, Saparov T, Duran V, Pak A.
europepmc +1 more source
Do Humans Use Push-Down Stacks When Learning or Producing Center-Embedded Sequences? [PDF]
Ferrigno S, Cheyette SJ, Carey S.
europepmc +1 more source

