Christophe Costa Florêncio

Publication Activity (10 Years)

Years Active: 1999-2015
Publications (10 Years): 1

Top Topics

Efficient Learning

Grammatical Inference

Machine Translation

Top Venues

Theor. Comput. Sci.

Publications

Christophe Costa Florêncio, Jonny Daenen, Jan Ramon, Jan Van den Bussche, Dries Van Dyck
Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time. J. Univers. Comput. Sci. 21 (7) (2015)
Spyros Martzoukos, Christof Monz, Christophe Costa Florêncio
Maximizing Component Quality in Bilingual Word-Aligned Segmentations. EACL (2014)
Christophe Costa Florêncio, Sicco Verwer
Regular inference as vertex coloring. Theor. Comput. Sci. 558 (2014)
Spyros Martzoukos, Christophe Costa Florêncio, Christof Monz
Investigating Connectivity and Consistency Criteria for Phrase Pair Extraction in Statistical Machine Translation. MOL (2013)
Christophe Costa Florêncio, Sicco Verwer
Regular Inference as Vertex Coloring. ALT (2012)
Christophe Costa Florêncio
Learning Tree Adjoining Grammars from Structures and Strings. ICGI (2012)
Christophe Costa Florêncio, Henning Fernau
On families of categorial grammars of bounded value, their learnability and related complexity questions. Theor. Comput. Sci. 452 (2012)
Jan Ramon, Fabrizio Costa, Christophe Costa Florêncio, Joost N. Kok
Preface. Fundam. Informaticae 113 (2) (2011)
Alexander Clark, Christophe Costa Florêncio, Chris Watkins
Languages as hyperplanes: grammatical inference with string kernels. Mach. Learn. 82 (3) (2011)
Christophe Costa Florêncio, Henning Fernau
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach. LATA (2010)
Christophe Costa Florêncio, Henning Fernau
Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG. ICGI (2010)
Jan Ramon, Fabrizio Costa, Christophe Costa Florêncio, Joost N. Kok
StReBio'09: statistical relational learning and mining in bioinformatics. SIGKDD Explor. 11 (2) (2009)
Christophe Costa Florêncio
Learning Node Label Controlled Graph Grammars (Extended Abstract). ICGI (2008)
Christophe Costa Florêncio
Tree Planar Languages. ICDM Workshops (2007)
Alexander Clark, Christophe Costa Florêncio, Chris Watkins
Languages as Hyperplanes: Grammatical Inference with String Kernels. ECML (2006)
Alexander Clark, Christophe Costa Florêncio, Chris Watkins, Mariette Sérayet
Planar Languages and Learnability. ICGI (2006)
Christophe Costa Florêncio
Rigid grammars in the Associative-Commutative Lambek Calculus are not learnable. EACL (2003)
Christophe Costa Florêncio
Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard. ICGI (2002)
Christophe Costa Florêncio
A Note on the Complexity of Associative-Commutative Lambek Calculus. TAG+ (2002)
Christophe Costa Florêncio
Conservative vs Set-driven Learning Functions for the Classes k-valued. CLIN (2001)
Christophe Costa Florêncio
Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard. LACL (2001)
Christophe Costa Florêncio
On the Complexity of Consistent Identification of Some Classes of Structure Languages. ICGI (2000)
Christophe Costa Florêncio
Consistent identification in the limit of some of Penn and Buszkowski's classes is NP-hard. CLIN (1999)