Sciweavers

102 search results - page 15 / 21
» Tile Rewriting Grammars
Sort
View
CERA
2002
134views more  CERA 2002»
13 years 6 months ago
Graph Grammar Based Product Family Modeling
: Many industries are shifting from mass production to mass customization, which demands quick response to the needs of individual customers with high quality and low costs. The de...
Xuehong Du, Jianxin Jiao, Mitchell M. Tseng
ICDT
2010
ACM
147views Database» more  ICDT 2010»
13 years 10 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
LACL
2005
Springer
14 years 6 days ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis
PPDP
2007
Springer
14 years 25 days ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
DLT
2006
13 years 8 months ago
Noncanonical LALR(1) Parsing
This paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing the usage of noncanonical parsers. To this end, we...
Sylvain Schmitz