21 search results - page 4 / 5 » Strongly Regular Grammars and Regular Approximation of Conte... |
EACL
1989
ACL Anthology
13 years 8 months ago
1989
ACL Anthology
Approximately, 10,000 naturally occurring noun phrases taken from the LOB corpus were used firstly, to evaluate the NP component of the Alvey ANLT grammar (Grover et al., 1987, 19...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
BIRTHDAY
1997
Springer
13 years 11 months ago
1997
Springer
We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzz...
LACL
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
JMLR
2011
13 years 2 months ago
2011
A strong inductive bias is essential in unsupervised grammar induction. In this paper, we explore a particular sparsity bias in dependency grammars that encourages a small number ...