Publications
Most of my publications from the period 2007-2010 can be found in K.U. Leuven's repository Lirias: https://lirias.kuleuven.be/.
The full text of my PhD thesis is downloadable from Utrecht University's Igitur archive: http://igitur-archive.library.uu.nl/dissertations/2003-1117-104905/inhoud.htm.
DBLP page: http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/f/Flor=ecirc=ncio:Christophe_Costa.html.
Scopus: https://www.scopus.com/authid/detail.uri?authorId=24558914300
Google scholar: http://scholar.google.nl/citations?hl=en&user=HdPV0C8AAAAJ&oi=sra.
SemanticScholar: https://www.semanticscholar.org/author/Christophe-Costa-Flor%C3%AAncio/1730893
Academia.edu: http://uva.academia.edu/ChristopheCostaFlorencio.
ResearchGate:http://www.researchgate.net/profile/Christophe_Florencio/
Microsoft Academic Search: http://academic.research.microsoft.com/Author/2540540/christophe-costa-florencio
AMiner: https://www.aminer.cn/profile/christophe-costa-flor-ncio/53f42b56dabfaec22b9f6f27
List of publications as bibtex file.
2015
With Jonny Daenen, Jan Ramon, Jan Van den Bussche, Dries Van Dyck: `Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time'
Journal of Universal Computer Science, Volume 21, No 7, pp. 891-911.
2014
With Spyros Martzoukos and Christof Monz: `Maximizing Component Quality in Bilingual Word-Aligned Segmentations'
In Wintner and Goldwater (Eds.), Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, Gothenburg, Sweden, April 2014, ACL, pp. 30-38.
http://www.aclweb.org/anthology/E14-1004
With Sicco Verwer: `Regular inference as vertex coloring'
Theoretical Computer Science, Volume 558, Elsevier, pp. 18–34.
2013
With Spyros Martzoukos and Christof Monz: `Investigating Connectivity and Consistency Criteria for Phrase Pair Extraction in Statistical Machine Translation'
In Kornai and Kuhlmann (Eds.), Proceedings of 13th Meeting on the Mathematics of Language (MoL 13), Sofia, Bulgaria, August 9, ACL/Omnipress Inc, pp. 93-101.
https://aclanthology.org/W13-3010/
2012
With Henning Fernau: `On families of categorial grammars of bounded value, their learnability and related complexity questions'
Theoretical Computer Science, Volume 452, Elsevier, pp. 21–38.
http://dx.doi.org/10.1016/j.tcs.2012.05.016
`Learning Tree Adjoining Grammars from structures and strings'
JMLR: Workshop and conference proceedings 21: ICGI 2012, Washington D.C., USA, 5-8 September, pp. 129-132.
http://jmlr.csail.mit.edu/proceedings/papers/v21/
With Sicco Verwer: `Regular inference as vertex coloring'
Proceedings of 23rd International Conference on Algorithmic Learning Theory ALT 2012, Lyon, France, Springer Berlin Heidelberg, October, 2012, pp. 81-95.
http://dx.doi.org/10.1007/978-3-642-34106-9_10
2011
With Alex Clark and Chris Watkins: `Languages as hyperplanes: grammatical inference with string kernels'
Machine Learning, Vol. 82, Issue 3, Springer Netherlands, pp. 351--373.
https://link.springer.com/article/10.1007/s10994-010-5218-3
With Jan Ramon, Fabrizio Costa and Joost Kok, as co-editor and co-author of preface to special issue of Fundamenta Informaticae: Machine Learning in Bioinformatics, Vol. 113:(2), IOS Press, pp i-ii.
https://content.iospress.com/articles/fundamenta-informaticae/fi113-2-01
2010
With Henning Fernau: `Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach'
In Dediu, Fernau, Martín-Vide (Eds.), 4th International Conference on Language and Automata Theory and Applications (LATA 2010), Trier, Germany, May 24-28. volume 6031 of Lecture Notes in Computer Science, Springer, pp. 202-213
https://doi.org/10.1007/978-3-642-13089-2_17
With Henning Fernau: `Hölder norms and a hierarchy theorem for parameterized classes of CCG'
In Sempere and García (Eds.), Proceedings of Grammatical Inference: Theoretical Results and Applications, 10th International Colloquium, ICGI 2010, Valencia, Spain, 13-16 September, pp. 280-283
https://link.springer.com/chapter/10.1007/978-3-642-15488-1_26
2009
With Henning Fernau: `Complexity of Consistency in Categorial Grammars'
In Mielke, Staiger and Winter (Eds.), Proceedings of Theorietag Automaten und Formale Sprachen 2009, Technical Report 2009/03 of the University Halle-Wittenberg, Institute of Computer Science, Lutherstadt Wittenberg, Germany, 28--30 September, pp. 15-17
Editor, with Jan Ramon, Fabrizio Costa and Joost Kok, of Proceedings of StReBio'09, the KDD 2009 Workshop on Statistical and Relational Learning in Bioinformatics. Paris, France, 28 June
https://dl.acm.org/doi/proceedings/10.1145/1562090
`Identification of NCE graph grammars'
In Herman Stehouwer (Ed.), Proceedings of Benelearn '09, the 18th annual Belgian-Dutch conference on machine learning, Tilburg, the Netherlands, 18-19 May 2009, pp. 115-116
https://lirias.kuleuven.be/bitstream/123456789/230931/1/bene_abstr.pdf
With Jan Ramon, Jonny Daenen, Jan van den Bussche and Dries van Dyck: `Graph grammars as language bias in graph mining'
In Blockeel, Borgwardt and Yan (Eds.), 7th International Workshop on Mining and Learning with Graphs, Extended Abstracts, Leuven, Belgium, 2-4 July 2009, pp. 16-18
https://www.academia.edu/2712162/Graph_grammars_as_language_bias_in_graph_mining
`Identification of Hyperedge-Replacement graph grammars'
In Blockeel, Borgwardt and Yan (Eds.), 7th International Workshop on Mining and Learning with Graphs, Extended Abstracts, Leuven, Belgium, 2-4 July 2009, pp. 19-21
2008
`Learning Node Label Controlled Graph Grammars: Extended Abstract'
In Clark, Coste and Miclet (Eds.), Lecture Notes in Artificial Intelligence 5278, Proceedings of ICGI'08, 9th International Colloquium on Grammatical Inference, St Malo, Britanny, France, 22-24 September
https://link.springer.com/chapter/10.1007/978-3-540-88009-7_24
`Inductive Graph Logic Programming: work in progress'
In Železný and Lavrač, (Eds.), Late breaking papers of Inductive Logic Programming, 18th International Conference, ILP 2008, Prague, Czech Republic, 10-12 September, pp. 14-19
Co-Editor, with Jan Ramon, Fabrizio Costa and Joost Kok, of Proceedings of StreBio, Statistical and Relational Learning in Bioinformatics, Workshop at ECML-PKDD 2008
2007
`Unsupervised learning of graph languages using kernels'
MLG'07, The 5th International Workshop on Mining and Learning with Graphs, Università degli Studi di Firenze, Florence, Italy, 1-2 August
'Unsupervised learning of graph languages using kernels'
The 19th Belgian-Dutch Conference on Artificial Intelligence, BNAIC-07, Utrecht, The Netherlands, 5-6 November
`Unsupervised learning of graph languages using kernels: New results'
Geibel and Brijnesh, (Eds.), KI 2007 Workshop on Learning from Non-Vectorial Data, pp. 1-8
`Tree planar languages'
Yan, X. and Holder, L.B., (Eds.), Proceedings of the ICDM Workshop on Mining Graphs and Complex Structures, pp. 405-410
2006
`Languages as Hyperplanes: Grammatical Inference with String Kernels'
With Alexander Clark and Chris Watkins. In Proceedings of ECML 2006, 17th European Conference on Machine Learning. Humboldt-Universität, Berlin, Germany, 18--22 September, pp. 90-101
Distinguished with the ECML Innovative Contribution Award
http://www.cs.rhul.ac.uk/home/alexc/papers/ecmlGiskFinal.pdf
`Planar Languages and Learnability'
With Alexander Clark, Chris Watkins and Mariette Serayet. In Proceedings of ICGI 2006, 8th International Colloquium on Grammatical Inference. University of Electro-Communications, Chofu, Tokyo, Japan, 20-22 September, pp. 148-160
http://www.cs.rhul.ac.uk/home/alexc/papers/icgiGiskFinal.pdf
`Performing experiments in Grammar Induction: practical issues'
Grammatical inference workshop, Laboratoire Hubert Curien, 20-22 November. Two-page abstract in program, no proceedings.
2003
`Learning Categorial Grammars'
PhD thesis, Utrecht University, UiL OTS.
https://dspace.library.uu.nl/handle/1874/629
`Rigid grammars in the associative-commutative Lambek calculus are not learnable'
In Copestake and Hajič, (Eds.), Proceedings of EACL2003, Tenth Conference of the European Chapter of the Association for Computational Linguistics, Agro Hotel, Budapest, 12-17 April, pp. 75-82
https://dl.acm.org/doi/10.3115/1067807.1067819
2002
`A Note on the Complexity of Associative-Commutative Lambek Calculus'
In Frank, (Ed.), Proceedings of the Sixth International Workshop on Tree Adjoining Grammars and Related Frameworks, TAG+6, Università di Venezia, pp. 159-162
https://www.aclweb.org/anthology/W02-2222/
`Conservative vs Set-driven Learning Functions for the Class k-Valued'
In Theune, Nijholt and Hondorp, (Eds.), Proceedings of CLIN2001, Selected Papers from the Twelfth CLIN Meeting, in Studies in Practical Linguistics 45 (1), Rodopi, Amsterdam, New York, pp. 38-46
https://clinjournal.org/clinj/CLIN12
`Consistent Identification in the Limit of Rigid Grammars from Strings is NP-hard'
In Adriaans, Fernau, van Zaanen, (Eds.), Lecture Notes in Artificial Intelligence 2484, Proceedings of ICGI-2002, Springer Verlag, pp. 49-62
https://link.springer.com/chapter/10.1007/3-540-45790-9_5
`Learning Generalized Quantifiers'
In Nissim, (Ed.), Proceedings of the ESSLLI02 Student Session, pp. 31-40
`Language, Learning and Complexity'
In Baauw, Huiskes and Schoorlemmer, (Eds.), UiL OTS Yearbook
2001
`Combinatory Categorial Grammars and Finite Elasticity'
In Hoste and de Pauw, (Eds.), Proceedings of BENELEARN, the Eleventh Belgian-Dutch Conference on Machine Learning, University of Antwerp, pp. 13-18
`An Avalanche of Hypotheses'
In notes of Workshop on Logic and Learning, affiliated with the IEEE, Symposium on Logic in Computer Science, LICS 2001, Boston, MA, 19-20 June
`Consistent Identification in the Limit of Any of the Classes k-Valued Is NP-hard'
In de Groote, Morrill, Retoré, (Eds.), Logical Aspects of Computational Linguistics, volume 2099 of Lecture Notes in Artificial Intelligence, Springer-Verlag, pp. 125-138
2000
`On the Complexity of Consistent Identification of some Classes of Structure Languages'
In Oliveira, (Ed.), Grammatical Inference: Algorithms and Applications, volume 1891 of Lecture Notes in Artificial Intelligence, Springer-Verlag, pp. 89-102
`Consistent Identification in the Limit of Some of Penn and Buszkowski's Classes is NP-hard'
In Monachesi, (Ed.), Computational Linguistics in the Netherlands 1999, Selected Papers from the Tenth CLIN Meeting, December 10, OTS Utrecht, pp. 1-12
https://www.clinjournal.org/clinj/CLIN10
1998
`Efficient learning algorithms for some classes of categorial grammars'
Master's thesis, Dept. of Philosophy, University of Utrecht, Utrecht, the Netherlands
`Rats on film'
Internship report, Rudolf Magnus Institute, Utrecht, The Netherlands
With J.B. Rousseau, P.B. van Lochem, W. Melder, and W.H. Gispen,
and B.M. Spruijt. Classification of rat behavior by a neural network. In Measuring Behavior '98, 2nd International Conference on Methods and Techniques in Behavioral Research, 18-21 August 1998, Groningen, The Netherlands
https://www.measuringbehavior.org/events/mb98/abstracts/rousseau1.htm