Sciweavers

164 search results - page 13 / 33
» General Multigenerative Grammar Systems
Sort
View
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
LISA
2003
13 years 8 months ago
Using Service Grammar to Diagnose BGP Configuration Errors
Often network components work correctly, yet end-to-end services don’t. This happens if configuration parameters of components are set to incorrect values. Configuration is a fu...
Xiaohu Qie, Sanjai Narain
LACL
2005
Springer
14 years 27 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
APPML
2007
92views more  APPML 2007»
13 years 7 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
ICTAI
2008
IEEE
14 years 1 months ago
Discovering Program's Behavioral Patterns by Inferring Graph-Grammars from Execution Traces
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
Chunying Zhao, Keven Ates, Jun Kong, Kang Zhang