Christophe Costa Florêncio

According to our database, Christophe Costa Florêncio authored at least 21 papers between 1999 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time.

Christophe Costa Florêncio, Jonny Daenen, Jan Ramon, Jan Van den Bussche, Dries Van Dyck

J. Univers. Comput. Sci., 2015

2014

Regular inference as vertex coloring.

Christophe Costa Florêncio, Sicco Verwer

Theor. Comput. Sci., 2014

Maximizing Component Quality in Bilingual Word-Aligned Segmentations.

Spyros Martzoukos, Christof Monz, Christophe Costa Florêncio

Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, 2014

2013

Investigating Connectivity and Consistency Criteria for Phrase Pair Extraction in Statistical Machine Translation.

Spyros Martzoukos, Christophe Costa Florêncio, Christof Monz

Proceedings of the 13th Meeting on the Mathematics of Language, 2013

2012

On families of categorial grammars of bounded value, their learnability and related complexity questions.

Christophe Costa Florêncio, Henning Fernau

Theor. Comput. Sci., 2012

Learning Tree Adjoining Grammars from Structures and Strings.

Christophe Costa Florêncio

Proceedings of the Eleventh International Conference on Grammatical Inference, 2012

2011

Languages as hyperplanes: grammatical inference with string kernels.

Alexander Clark, Christophe Costa Florêncio, Chris Watkins

Mach. Learn., 2011

Preface.

Jan Ramon, Fabrizio Costa, Christophe Costa Florêncio, Joost N. Kok

Fundam. Informaticae, 2011

2010

Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach.

Christophe Costa Florêncio, Henning Fernau

Proceedings of the Language and Automata Theory and Applications, 2010

Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG.

Christophe Costa Florêncio, Henning Fernau

Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

2009

StReBio'09: statistical relational learning and mining in bioinformatics.

Jan Ramon, Fabrizio Costa, Christophe Costa Florêncio, Joost N. Kok

SIGKDD Explor., 2009

2008

Learning Node Label Controlled Graph Grammars (Extended Abstract).

Christophe Costa Florêncio

Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

2007

Tree Planar Languages.

Christophe Costa Florêncio

Proceedings of the Workshops Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), 2007

2006

Planar Languages and Learnability.

Alexander Clark, Christophe Costa Florêncio, Chris Watkins, Mariette Sérayet

Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

2003

Rigid grammars in the Associative-Commutative Lambek Calculus are not learnable.

Christophe Costa Florêncio

Proceedings of the EACL 2003, 2003

2002

A Note on the Complexity of Associative-Commutative Lambek Calculus.

Christophe Costa Florêncio

Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks, 2002

Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard.

Christophe Costa Florêncio

Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

2001

Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard.

Christophe Costa Florêncio

Proceedings of the Logical Aspects of Computational Linguistics, 2001

Conservative vs Set-driven Learning Functions for the Classes k-valued.

Christophe Costa Florêncio

Proceedings of the Computational Linguistics in the Netherlands 2001, 2001

2000

On the Complexity of Consistent Identification of Some Classes of Structure Languages.

Christophe Costa Florêncio

Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

1999

Consistent identification in the limit of some of Penn and Buszkowski's classes is NP-hard.

Christophe Costa Florêncio

Proceedings of the Computational Linguistics in the Netherlands 1999, 1999