• Tiburon

  • Referenced in 13 articles [sw01312]
  • designed to handle weighted regular tree grammars, context-free grammars, and both tree-to-tree...
  • tRNAscan-SE

  • Referenced in 12 articles [sw08005]
  • secondary structure profiles based on stochastic context-free grammars. tRNAscan-SE searches...
  • GP-COACH

  • Referenced in 9 articles [sw09137]
  • rules (generated by means of a context-free grammar) coded as one rule per tree...
  • TRX

  • Referenced in 8 articles [sw08800]
  • correct parsers. We are using parsing expression grammars (PEGs), a formalism essentially representing recursive descent ... consider an attractive alternative to context-free grammars (CFGs). From this formalization we can extract...
  • Elkhound

  • Referenced in 7 articles [sw00236]
  • grammars, and can parse with any context-free grammar, including ambiguous grammars. However, adoption...
  • GenRGenS

  • Referenced in 5 articles [sw09070]
  • Markov chains, hidden Markov models, weighted context-free grammars, regular expressions and PROSITE expressions. GenRGenS ... only program that can handle weighted context-free grammars, thus allowing the user to model...
  • CONTRAfold

  • Referenced in 7 articles [sw17117]
  • secondary structure prediction. More recently, stochastic context-free grammars (SCFGs) have emerged as an alternative...
  • GRM

  • Referenced in 4 articles [sw00391]
  • software design principles of a general grammar library designed for use in spoken-dialogue systems ... used in particular to compile weighted context-dependent rewrite rules into weighted finite-state transducers ... read and compile, when possible, weighted context-free grammars into weighted automata, and dynamically modify...
  • YAKKER

  • Referenced in 2 articles [sw17046]
  • Semantics and algorithms for data-dependent grammars. We present the design and theory ... parsing engine handles (1) full scannerless context-free grammars with (2) regular expressions as right...
  • DynGenPar

  • Referenced in 1 article [sw06424]
  • approaches and the expressiveness of extended context-free grammars such as parallel multiple context-free...
  • YakYak

  • Referenced in 2 articles [sw07540]
  • often described by means of a context-free grammar, which is restricted by constraints programmed...
  • sigma GTTM

  • Referenced in 2 articles [sw22132]
  • statistical model called probabilistic context-free grammar, which enables us to acquire the most probabilistic...
  • JAMOOS

  • Referenced in 1 article [sw02520]
  • cohesive suite for quick definition of attribute grammars and generation of compilers, interpreters and other ... reduction of rules in an attribute context-free grammar. JAMOOS has a rich object oriented ... also as a language for specifying context-free grammars...
  • GRADIENT

  • Referenced in 1 article [sw23758]
  • predictive systems. This work presents the GRADIENT (GRAmmar-DrIven ENsemble sysTem) framework for the generation ... tasks. The proposed model uses a context-free grammar guided genetic programming for the automatic...
  • gramEvol

  • Referenced in 1 article [sw21389]
  • expressions generated via a user-defined context-free grammar (CFG) and cost function...
  • MedScan

  • Referenced in 1 article [sw23129]
  • engine utilizes a specially developed context-free grammar and lexicon. Preliminary evaluation of the system...
  • Logichart

  • Referenced in 1 article [sw01253]
  • grammar is underlain by a context-free graph grammar whose productions are defined to formalize...
  • Juggrnaut

  • Referenced in 1 article [sw13410]
  • data structures. It employs graph grammars, more precisely context-free hyperedge replacement grammars. We will...
  • GraSy

  • Referenced in 0 articles [sw05855]
  • GraSy is a tool that converts context-free grammars, which are written in the ”Backus...
  • Coq

  • Referenced in 1306 articles [sw00161]
  • Coq is a formal proof management system. It...