Sciweavers

27 search results - page 2 / 6
» Analyzing Ambiguity of Context-Free Grammars
Sort
View
ICGI
2010
Springer
13 years 2 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
APLAS
2006
ACM
13 years 11 months ago
XML Validation for Context-Free Grammars
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
Yasuhiko Minamide, Akihiko Tozawa
BMCBI
2005
99views more  BMCBI 2005»
13 years 5 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
TCBB
2011
13 years 14 days ago
Semantics and Ambiguity of Stochastic RNA Family Models
Stochastic models such as hidden Markov models or stochastic context free grammars can fail to return the correct, maximum likelihood solution in the case of semantic ambiguity. T...
Robert Giegerich, Christian Höner zu Siederdi...
CL
2000
Springer
13 years 5 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...