Sciweavers

102 search results - page 10 / 21
» Tile Rewriting Grammars
Sort
View
FPL
2001
Springer
101views Hardware» more  FPL 2001»
13 years 11 months ago
An FPGA-Based Syntactic Parser for Real-Life Almost Unrestricted Context-Free Grammars
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by almost unrestricted real-life context-free grammars (CFGs). More prec...
Cristian Ciressan, Eduardo Sanchez, Martin Rajman,...
BIBE
2005
IEEE
121views Bioinformatics» more  BIBE 2005»
14 years 10 days ago
RNA Pseudoknot Prediction Using Term Rewriting
RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural motifs found in a...
Xuezheng Fu, Hao Wang, William L. Harrison, Robert...
DLT
2004
13 years 8 months ago
On Competence in CD Grammar Systems
Abstract. We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying ...
Maurice H. ter Beek, Erzsébet Csuhaj-Varj&u...
ACL
2001
13 years 8 months ago
Generating with a Grammar Based on Tree Descriptions: a Constraint-Based Approach
While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures o...
Claire Gardent, Stefan Thater
COLING
2010
13 years 1 months ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier