Results 1 to 10 of about 1,698 (255)

Building Domain Specific Languages for Voice Recognition Applications [PDF]

open access: yesInformatică economică, 2008
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  

Ordered context-free grammars

open access: yes, 1999
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

open access: yesInternational Journal of Computer Mathematics, 1981
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

open access: yesComputational Linguistics, 2021
Noah A. Smith, Mark Johnson
doaj   +1 more source

Evolving stochastic context--free grammars for RNA secondary structure prediction. [PDF]

open access: yesBMC Bioinformatics, 2012
Wj Anderson J   +4 more
europepmc   +1 more source

Parsing social network survey data from hidden populations using stochastic context-free grammars. [PDF]

open access: yesPLoS One, 2009
Poon AF   +7 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy