Sciweavers

Share
ICGI
2010
Springer
9 years 7 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
ICGI
2010
Springer
9 years 7 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
ICGI
2010
Springer
9 years 8 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
ICGI
2010
Springer
9 years 8 months ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
Sophia Katrenko, Menno van Zaanen
ICGI
2010
Springer
9 years 8 months ago
Grammatical Inference as Class Discrimination
Abstract. Grammatical inference is typically defined as the task of finding a compact representation of a language given a subset of sample sequences from that language. Many di...
Menno van Zaanen, Tanja Gaustad
ICGI
2010
Springer
9 years 10 months ago
Grammatical Inference Algorithms in MATLAB
Although MATLAB1 has become one of the mainstream languages for the machine learning community, there is still skepticism among the Grammatical Inference (GI) community regarding t...
Hasan Ibne Akram, Colin de la Higuera, Huang Xiao,...
ICGI
2010
Springer
9 years 10 months ago
Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
Alexander Clark
ICGI
2010
Springer
9 years 10 months ago
Enhanced Suffix Arrays as Language Models: Virtual k-Testable Languages
Abstract. In this article, we propose the use of suffix arrays to efficiently implement n-gram language models with practically unlimited size n. This approach, which is used with ...
Herman Stehouwer, Menno van Zaanen
books