Sciweavers

ICGI
2004
Springer
14 years 29 days ago
Partial Learning Using Link Grammars Data
Abstract. Kanazawa has shown that several non-trivial classes of categorial grammars are learnable in Gold’s model. We propose in this article to adapt this kind of symbolic lear...
Erwan Moreau
ICGI
2004
Springer
14 years 29 days ago
Identifying Clusters from Positive Data
The present work studies clustering from an abstract point of view and investigates its properties in the framework of inductive inference. Any class S considered is given by a hyp...
John Case, Sanjay Jain, Eric Martin, Arun Sharma, ...
ICGI
2004
Springer
14 years 29 days ago
Navigation Pattern Discovery Using Grammatical Inference
We present a method for modeling user navigation on a web site using grammatical inference of stochastic regular grammars. With this method we achieve better models than the previo...
Nikolaos Karampatziakis, Georgios Paliouras, Dimit...
ICGI
2004
Springer
14 years 29 days ago
Learning Node Selecting Tree Transducer from Completely Annotated Examples
Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...
Julien Carme, Aurélien Lemay, Joachim Niehr...
ICGI
2004
Springer
14 years 29 days ago
Learning Stochastic Finite Automata
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
Colin de la Higuera, José Oncina
ICGI
2004
Springer
14 years 29 days ago
Identifying Left-Right Deterministic Linear Languages
Abstract. Left deteministic linear languages are a subclass of the context free languages that includes all the regular languages. Recently was proposed an algorithm to identify in...
Jorge Calera-Rubio, José Oncina
ICGI
2004
Springer
14 years 29 days ago
Learnability of Pregroup Grammars
Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first ...
Denis Béchet, Annie Foret, Isabelle Tellier
ICGI
2004
Springer
14 years 29 days ago
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
John Abela, François Coste, Sandro Spina
GRID
2004
Springer
14 years 29 days ago
Grid-based Indexing of a Newswire Corpus
In this paper we report experience in the use of computational grids in the domain of natural language processing, particularly in the area of information extraction, to create qu...
Baden Hughes, Srikumar Venugopal, Rajkumar Buyya
EUROGP
2004
Springer
108views Optimization» more  EUROGP 2004»
14 years 1 months ago
Genetic Programming for Natural Language Parsing
Parsing and Tagging are very important tasks in Natural Language Processing. Parsing amounts to searching the correct combination of grammatical rules among those compatible with a...
Lourdes Araujo