| Languages as hyperplanes: grammatical inference with string kernels A Clark, C Costa Florêncio, C Watkins Machine Learning: ECML 2006, 90-101, 2006 | 31 | 2006 |
| Consistent Identification in the Limit of Any of the Classes k-Valued Is NP-hard C Costa Florêncio Logical Aspects of Computational Linguistics, LECTURE NOTES IN COMPUTER …, 2001 | 29* | 2001 |
| Planar languages and learnability A Clark, C Costa Florêncio, C Watkins, M Serayet Grammatical Inference: Algorithms and Applications, 148-160, 2006 | 22 | 2006 |
| Learning categorial grammars C Costa Florêncio PhD thesis, Utrecht University, 2003 | 21* | 2003 |
| Consistent Identification in the Limit of Rigid Grammars from Strings is NP-hard C Costa Florêncio Grammatical Inference: Algorithms and Applications, 729-733, 2002 | 19* | 2002 |
| Learning generalized quantifiers C Costa Florêncio Proceedings of Seventh ESSLLI Student Session, 2002 | 12 | 2002 |
| Consistent identification in the limit of some Penn and Buszkowski’s classes is NP-hard C Costa Florêncio Proceedings of the International Conference on Computational Linguistics, 1999 | 10* | 1999 |
| Regular inference as vertex coloring C Costa Florêncio, S Verwer Theoretical Computer Science 558, 18-34, 2014 | 9* | 2014 |
| Regular inference as vertex coloring C Costa Florêncio, S Verwer Algorithmic Learning Theory, 81-95, 2012 | 9* | 2012 |
| Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time CC Florêncio, J Daenen, J Ramon, J Van den Bussche, D Van Dyck Journal of Universal Computer Science 21 (7), 891-911, 2015 | 7 | 2015 |
| Languages as hyperplanes: grammatical inference with string kernels A Clark, C Costa Florêncio, C Watkins Machine Learning 82 (3), 351-373, 2011 | 7 | 2011 |
| On families of categorial grammars of bounded value, their learnability and related complexity questions C Costa Florêncio, H Fernau Theoretical Computer Science 452, 21-38, 2012 | 6 | 2012 |
| On the complexity of consistent identification of some classes of structure languages C Costa Florêncio Grammatical Inference: Algorithms and Applications, 89-102, 2000 | 5* | 2000 |
| Identification of Hyperedge-Replacement Graph Grammars C Costa Florêncio | 4 | 2009 |
| Investigating Connectivity and Consistency Criteria for Phrase Pair Extraction in Statistical Machine Translation S Martzoukos, C Costa Florêncio, C Monz The 13th Meeting on the Mathematics of Language, 93, 2013 | 3 | 2013 |
| Finding consistent categorial grammars of bounded value: a parameterized approach C Costa Florêncio, H Fernau Language and Automata Theory and Applications, 202-213, 2010 | 2* | 2010 |
| Learning Node Label Controlled Graph Grammars C Costa Florêncio Grammatical Inference: Algorithms and Applications, 286-288, 2008 | 2 | 2008 |
| A note on the complexity of the associative-commutative Lambek calculus C Costa Florêncio Proceedings of the 6th Int’l Workshop on Tree Adjoining Grammar and Related …, 2002 | 2* | 2002 |
| Combinatory categorial grammars and finite elasticity C Costa Florêncio | 2 | 2001 |
| Maximizing Component Quality in Bilingual Word-Aligned Segmentations S Martzoukos, C Costa Florêncio, C Monz EACL, 2014 | 1 | 2014 |
Chris WatkinsProfessor in Computer Science, Royal HollowayVerified email at rhul.ac.uk
