179 search results - page 7 / 36 » Lambek Grammars Are Context Free |
CPAIOR
2009
Springer
14 years 2 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
The paper describes an extensive experiment in inside-outside estimation of a lexicalized probabilistic context free grammar for German verbnal clauses. Grammar and formalism feat...
ACL
1997
13 years 9 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...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from t...