179 search results - page 12 / 36 » Lambek Grammars Are Context Free |
DAGM
2008
Springer
13 years 9 months ago
2008
Springer
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...
DLT
2001
13 years 9 months ago
2001
Context-free valence languages (over Zk ) are shown to be codings of the intersection of a context-free language and a blind kcounter language. This afl-style characterization all...
IJCNLP
2004
Springer
14 years 28 days ago
2004
Springer
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...
FPL
2001
Springer
14 years 1 days ago
2001
Springer
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...
WCRE
1997
IEEE
13 years 11 months ago
1997
IEEE
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...