Sciweavers

182 search results - page 9 / 37
» Context-Free Valence Grammars - Revisited
Sort
View
FCCM
2000
IEEE
83views VLSI» more  FCCM 2000»
15 years 1 months ago
An FPGA-Based Coprocessor for the Parsing of Context-Free Grammars
This paper presents an FPGA-based implementation of a co-processing unit able to parse context-free grammars of real-life sizes. The application elds of such a parser range from p...
Cristian Ciressan, Eduardo Sanchez, Martin Rajman,...
86
Voted
DAGM
2008
Springer
14 years 11 months ago
Natural Language Understanding by Combining Statistical Methods and Extended Context-Free Grammars
This paper introduces an novel framework for speech understanding using extended context-free grammars (ECFGs) by combining statistical methods and rule based knowledge. By only us...
Stefan Schwärzler, Joachim Schenk, Frank Wall...
IJCNLP
2004
Springer
15 years 2 months ago
Iterative CKY Parsing for Probabilistic Context-Free Grammars
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...
Yoshimasa Tsuruoka, Jun-ichi Tsujii
71
Voted
FPL
2001
Springer
101views Hardware» more  FPL 2001»
15 years 1 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,...
WCRE
1997
IEEE
15 years 1 months ago
Generation of Components for Software Renovation Factories from Context-Free Grammars
We present an approach for the generation of components for a software renovation factory. These components are generated from a context-free grammar definition that recognizes t...
Mark van den Brand, M. P. A. Sellink, Chris Verhoe...