Sciweavers

382 search results - page 53 / 77
» Generalized Multitext Grammars
Sort
View
ENTCS
2008
99views more  ENTCS 2008»
13 years 7 months ago
SPPF-Style Parsing From Earley Recognisers
In its recogniser form, Earley's algorithm for testing whether a string can be derived from a grammar is worst case cubic on general context free grammars (CFG). Earley gave ...
Elizabeth Scott
CLIN
2004
13 years 8 months ago
Machine Learning and the Cognitive Basis of Natural Language
Machine learning and statistical methods have yielded impressive results in a wide variety of natural language processing tasks. These advances have generally been regarded as eng...
Shalom Lappin
CADE
2008
Springer
14 years 7 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
TOOLS
2009
IEEE
14 years 2 months ago
Guaranteeing Syntactic Correctness for All Product Line Variants: A Language-Independent Approach
A software product line (SPL) is a family of related program variants in a well-defined domain, generated from a set of features. A fundamental difference from classical applicati...
Christian Kästner, Sven Apel, Salvador Trujil...
PPDP
2009
Springer
14 years 1 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus