47 search results - page 4 / 10 » Partially-Commutative Context-Free Processes |
ICGI
2004
Springer
14 years 24 days ago
2004
Springer
This paper describes the Omphalos Context-Free Grammar Learning Competition held as part of the International Colloquium on Grammatical Inference 2004. The competition was created ...
ACL
1997
13 years 8 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
FPL
2001
Springer
13 years 12 months 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...
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...
WOLLIC
2010
Springer
13 years 5 months ago
2010
Springer
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...