273 search results - page 6 / 55 » Extensible Grammars for Language Specialization |
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
ICGI
1998
Springer
13 years 11 months ago
1998
Springer
In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken int...
CSR
2010
Springer
14 years 8 days ago
2010
Springer
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
PLILP
1992
Springer
13 years 11 months ago
1992
Springer
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The "programs" in this language take text or parse trees as input an...
COLING
1996
13 years 8 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...