Sciweavers

3440 search results - page 2 / 688
» Logics For Context-Free Languages
Sort
View
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
15 years 1 months ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 1 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
IPL
2006
120views more  IPL 2006»
14 years 9 months ago
Propositional dynamic logic of context-free programs and fixpoint logic with chop
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
Martin Lange, Rafal Somla
ICALP
1993
Springer
15 years 1 months ago
Local Model Checking for Context-Free Processes
Hardi Hungar, Bernhard Steffen