Airelles (Ressources Linguistiques)



Bibliographie (depuis 2000)

Incluant celle de l'ex équipe Langages jusqu'à 2006

2009

[1] Miguel A. Molinero, Benoît Sagot et Lionel Nicolas. Building a morphological and syntactic lexicon by merging various linguistic ressources. NODALIDA 2009, Odense,Danemark, mai 2009.
[2] Lionel Nicolas, Benoît Sagot, Miguel A. Molinero, Jacques Farré et Éric de La Clergerie. Trouver et confondre les coupables: un processus sophistiqué de correction de lexique. TALN 2009, Senlis, France, juin 2009.
[3] Lionel Nicolas, Miguel A. Molinero, Benoît Sagot, Elena Sanchez Trigo, Eric de La Clergerie, Miguel Alonso Pardo, Jacques Farré et Joan Miquel Verges. Towards efficient production of linguistic resources: the Victoria Project. RANLP 2009, Borovets, Bulgaria, septembre 2009.
[4] Miguel A. Molinero, Benoît Sagot et Lionel Nicolas. A morphological and syntactic wide-coverage lexicon for Spanish: The leffe. RANLP 2009, Borovets, Bulgaria, septembre 2009.
[5] Lionel Nicolas, Miguel A. Molinero, Benoît Sagot, Elena Sanchez Trigo, Eric de La Clergerie, Miguel Alonso Pardo, Jacques Farré et Joan Miquel Verges. Producción eficiente de recursos linguisticos: el proyecto Victoria. SEPLN 2009, San Sebastian, septembre 2009.
[6] Miguel A. Molinero, Benoît Sagot et Lionel Nicolas. Construcción y extensión de un léxico morfológico y sintáctico para el Espanol: el Leffe. SEPLN 2009, San Sebastian, septembre 2009.
[7] Eric de la Clergerie, Benoît Sagot, Lionel Nicolas et Marie-Laure Guénot. FRMG: évolutions d'un analyseur syntaxique TAG du français. Workshop ATALA de IWPT 2009, Paris, octobre 2009.

2008

[1] Lionel Nicolas, Benoît Sagot, Jacques Farré et Miguel Angel Molinero Alvarez et Eric De la Clergerie. Computer aided correction and extension of a syntactic wide-coverage lexicon. Coling 2008. [.pdf ]
[2] Lionel Nicolas, Benoît Sagot, Miguel A. Molinero,Jacques Farré et Éric de La Clergerie. Mining parsing results for lexical corrections: Toward a Complete Correction Process of Wide-Coverage Lexicons. LNAI 5603, Springer, 2008.
[3] Lionel Nicolas, Benoît Sagot, Miguel A. Molinero,Jacques Farré et Éric de La Clergerie. Extensión y corrección semi-automática de léxicos morfo-sintáctico. SEPLN 2008, Madrid.
[4] A. Kempe, J.-M. Champarnaud , Guingne and F. Nicart. Algorithms for the Join and Auto-Intersection of Multi-Tape Weighted Finite-State Machines. Intern. J. of Foundations of Comp. Sc. 19(2): pp 453-476.

2007

[1] Sylvain Schmitz. An experimental ambiguity detection tool. In Anthony Sloane and Adrian Johnstone, editors, LDTA'07: 7th Workshop on Language Descriptions, Tools and Applications, 2007. [.pdf ]
[2] Lionel Nicolas, Jacques Farré, and Éric V. de la Clergerie. Mining parsing results for lexical corrections. In LT&C'07: 3rd Language & Technology Conference.
[3] Jean-Marc Champarnaud, Franck Guingne, and Jacques Farré. Reducing acyclic cover transducers. In Jan Holub and Jan Ždárek, editors, CIAA'07: 12th International Conference on Implementation and Application of Automata, LNCS 4783, pages 38-50, Springer, 2007.
[4] Sylvain Schmitz. Conservative ambiguity detection in context-free grammars. In Lars Arge, Christian Cachin, Tomasz Jurdzinski, and Andrzej Tarlecki, editors, ICALP'07: 34th International Colloquium on Automata, Languages and Programming, volume 4596 of LNCS, pages 692-703. Springer, 2007. [.pdf ]
[5] Lionel Nicolas, Jacques Farré, and Éric V. de la Clergerie. Confondre le coupable : corrections à un lexique suggérées par une grammaire. In Farah Benamara, Nabil Hathout, Philippe Muller, and Sylwia Ozdowska, editors, Actes du Colloque TALN 2007, pages 315-324, Toulouse, June 2007. IRIT.
[6] Sylvain Schmitz. Approximating Context-Free Grammars for Parsing and Verification. Thèse de doctorat, Laboratoire I3S, Université de Nice-Sophia Antipolis, France, September 2007. [.pdf ]

2006

[1] Jacques Farré and Igor Litovsky. Editorial. Theoretical Computer Science, 363(2):107, 2006.
[2] José Fortes Gálvez, Sylvain Schmitz, and Jacques Farré. Shift-resolve parsing: Simple, linear time, unbounded lookahead. In Oscar H. Ibarra and Hsu-Chun Yen, editors, CIAA'06: 11th International Conference on Implementation and Application of Automata, volume 4094 of LNCS, pages 253-264. Springer, 2006.
[3] Sylvain Schmitz. Noncanonical LALR(1) parsing. In Zhe Dang and Oscar H. Ibarra, editors, Tenth International Conference: Developments in Language Theory - DLT'06, volume 4036, pages 95-107, Santa-Barbara, CA, USA, 2006. Springer.
[4] Sylvain Schmitz. Modular syntax demands verification. Technical Report I3S/RR-2006-32-FR, Laboratoire I3S, Université de Nice - Sophia Antipolis & CNRS, October 2006. [.pdf ]
[5] Lionel Nicolas. Fouille d'erreur en analyse syntaxique. Rapport de stage de master 2 recherche PMLT, École Doctorale STIC, Université de Nice - Sophia Antipolis, June 2006.
[6] Olivier Ponsini and Carine Fédèle. Mutable lists and call-by-reference with SOSSubC. WSEAS Transactions on Computers, 5(9):1942-1949, 2006.
[7] O. Ponsini and C. Fédèle. Towards verification of SubC programs with side effects. In 10th WSEAS International Conference on Computers,, page 7, Athens, Greece, July 2006.
[8] P. Crescenzo, C. Escazut, and M. Gautero. Contribution à la modélisation de le-learning. In Colloque TICE Méditerranée 2006,, Gênes, Italie, May 2006.
[11] S. Schmitz. Modular syntax demands verification. Technical report, Sophia Antipolis, 2006. Research Report.
[12] S. Schmitz. Conservative ambiguity detection in context-free grammars. Technical report, Sophia Antipolis, 2006. Research Report.
[13] A. Kempe, J.-M. Champarnaud, J. Eisner, F. Guingne, and F. Nicart. Algorithms for the join and auto-intersection of multi-tape weighted finite state machines. Intern. J. of Foundations of Comp. Sc, 2006.

2005

[1] Jacques Farré, Igor Litovsky, and Sylvain Schmitz, editors. Implementation and Application of Automata, 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers, volume 3845 of Lecture Notes in Computer Science. Springer, 2006.
[2] S. Aubert, P. Crescenzo, and M. Gautero. Modélisation UML pour le e-learning adaptatif. In Actes du Colloque euroméditerranéen et africain pour l'approndissement de la formation à distance - CEMAFORAD-2, pages 92-99, Bejaïa, Algérie, Nov. 2005.
[4] P. Crescenzo, C. Escazut, and M. Gautero. E-learning adaptatif ou comment donner de la personnalité à une fourmi ? Rapport de recherche. Sophia Antipolis, 2005.
[5] V. Granet and J.-P. Regourd. Aide-Mémoire de Java. Dunod, 2005.
[9] S. Schmitz. Noncanonical LALR(1) parsing. Technical report, Sophia Antipolis, 2005. Research Report.
[11] J.-M. Champarnaud, F. Guingne, and G. Hansel. Similarity relations and cover automata. RAIRO-Theoretical Informatics and Applications, 39(1):115-124, 2005.
[12] J.-M. Champarnaud, F. Guingne, and G. Hansel. Cover transducers for functions with finite domain. Intern. J. of Foundations of Comp. Sc., 16(5):851-865, 2005.
[13] A. Kempe, J.-M. Champarnaud, F. Guingne, and F. Nicart. Wfsm auto-intersection and join algorithms. In FSMNLP, Helsinki, Finland, September 1-2 2005.
[6] O. Lecarme. Review of optimization in gcc by Jones M., 2005.
[7] O. Lecarme. Review of an embedded domain-specific language for type-safe server-side web scripting by Thiemann P., 2005.
[8] O. Lecarme. Review of reducing data cache leakage energy using a compiler-based approach by Zhang W., Kandemir M., Karakoy M., Chen G., 2005.

2004

[1] J. Farré and J. Fortes Gàlvez. Bounded-connect noncanonical discriminating-reverse parsers. Theoretical Computer Science, 1(313):73-91, 2004.
[2] O. Lecarme. Review of optimization precision overhead for x86 processors by Ogasawara T., Komatsu H., Nakatani T., 2004.
[3] O. Lecarme. Review of compiler optimization correctness by temporal logic by Lacey D., Jones N., van Wyk E., Frederiksen C., 2004.
[4] O. Lecarme. Review of fast, accurate call graph profiling by Spivey J., 2004.
[5] O. Lecarme. Review of practical subversion by Rooney G., 2004.
[6] O. Lecarme. Review of a compiler framework for speculative optimizations by Lin J., Chen T., Hsu W., Yew P., Ju R., Ngai T., Chan S., 2004.
[7] O. Lecarme. Review of checking secure information flow in java bytecode by code transformation and standard bytecode verification by Bernardeschi C., de Francesco N., Lettieri G., Martini L., 2004.
[8] T. Gaal, F. Guingne, and F. Nicart. Other extension to finite state automata. Publicationes Mathematicae Debrecen, pages 525-534, 2004.
[9] F. Guingne, A. Kempe, and F. Nicart. Acyclic networks maximizing the printing complexity. Theoret. Comput. Sci., 328(1):39-51, 2004.
[10] A. Kempe, F. Nicart, and F. Guingne. Three new algorithms for wmtas. In M. Droste and H. Vogler, editors, WATA'04, 2004.
[11] J.-M. Champarnaud, F. Guingne, and G. Hansel. Cover k-automata. In M. Droste and H. Vogler, editors, WATA'04, 2004.
[12] J.-M. Champarnaud, F. Guingne, and G. Hansel. Reducing cover subsequential transducers. In L. Ilie and D. Wotschke, editors, DCFS'2004, pages 131-143, 2004.

2003

[1] O. Lecarme. Review of efficient spill code for sdram by Nandivada V., Palsberg J., 2003.
[2] O. Lecarme. Review of uml distilled: a brief guide to the standard object modeling language by Fowler M., 2003.
[3] O. Lecarme. Review of how logo has contributed to the understanding of the role of informatics in education and its relation to the learning process by Valente J., 2003.
[4] O. Lecarme. Review of eliminating synchronization bottlenecks using adaptive replication: a code and design conventions preprocessor for java by Rinard M., Diniz P., 2003.
[5] O. Lecarme. Review of buffer overflow and format string overflow vulnerabilities by Lhee K., Chapin S., 2003.
[6] O. Lecarme. Review of the power of symmetry: unifying inheritance and generative programming by Hutchins D., 2003.
[7] O. Lecarme. Review of a performance analysis of the berkeley upc compiler by Husbands P., Iancu C., Yelick K., 2003.
[8] O. Lecarme. Review of a framework for designing and implementating the ada standard container library by Marco J., Franch X., 2003.
[9] O. Lecarme. Review of pragmatic version control using cvs by Thomas D., Hunt A., 2003.
[10] O. Lecarme. Review of modeling and implementating adaptive pedagogical hyper documents by Benadi S., Prévot P., Ramel J., 2003.
[11] F. Guingne, F. Nicart, J.-M. Champarnaud, L. Karttunen, T. Gaal, and A. Kempe. Virtual operations on virtual networks: the priority union. Intern. J. of Foundations of Comp. Sc., 14(6):1055-1069, 2003.
[12] F. Guingne, A. Kempe, and F. Nicart. Running time complexity of printing an acyclic automaton. In O. H. Ibarra and Z. Dang, editors, CIAA 2003, volume 2759, pages 131-140. Springer Verlag, 2003.
[13] A. Kempe, C. Baeijs, T. Gaal, F. Guingne, and F. Nicart. Wfsc, a new weighted finite state compiler. In O. H. Ibarra and Z. Dang, editors, CIAA 2003, volume 2759, pages 108-119. Springer Verlag, 2003.
[14] F. Guingne and F. Nicart. Finite state lazy operations in nlp. In J.-M. Champarnaud and D. Maurel, editors, CIAA 2002, volume 2608, pages 138-147. Springer Verlag, 2003.

2002

[1] Olivier Ponsini, Carine Fédèle, and Emmanuel Kounalis. SOS C-: a system for interpreting operational semantics of C- programs. In 20th IASTED International Multi-Conference, Applied Informatics, AI 2002, pages 164-169, Innsbruck, Autriche, February 2002.
[2] Olivier Ponsini. Réécriture de programmes C- en équations logiques. Onzièmes Journées Francophones de Programmation Logique et Programmation par Contraintes, May 2002.
[3] Dick Grune, Henri E. Bal, Ceriel J.H. Jacobs, and Koen G. Langendoen. Compilateurs. Dunod, September 2002. Traduction de l'ouvrage original paru chez Wiley sous le titre Modern Compiler Design, par Carine Fédèle et Olivier Lecarme ; XXIV + 774 pages. [http ]

2001

[1] Jacques Farré and José Fortes Gálvez. Bounded-graph construction for noncanonical discriminating-reverse parsers. In B. Watson and D. Wood, editors, Implementation and Applications of Automata, 6th International Conference, CIAA 2001, volume 2494 of LNCS, pages 101-114. Springer-Verlag, January 2002.
[2] José Fortes Gálvez and Jacques Farré. Generalized epsilon-skip discriminating-reverse parsing on graph-structured stack. In 7th International Workshop on Parsing Technologies, IWPT 2001, Pékin, Chine, October 2001. Tsinghua University Press.
[3] Jacques Farré and José Fortes Gálvez. A bounded-connect construction for LR-regular parsers. In Reinhard Wilhelm, editor, International Conference on Compiler Construction, CC 2001, volume 2027 of LNCS, pages 244-258, Gênes, Italie, April 2001. Springer-Verlag.
[4] José Fortes Gálvez, Jacques Farré, and Miguel Angel Pérez Aguiar. Practical nondeterministic DR(k) parsing on graph-structured stack. In Alexander Gelbukh, editor, Second International Conference on Intelligent Text Processing and Computational Linguistics, CICLing'01, volume 2004 of LNCS, Mexico, Mexique, February 2001. Springer-Verlag.
[5] Robert-Olivier Cayot. Récupération automatique d'erreurs syntaxiques en analyse discriminante rétrograde. Thèse de doctorat, Université de Nice-Sophia Antipolis, École doctorale STIC, December 2001. [.ps.gz ]
[6] Jacques Farré. Sur quelques aspects théoriques et pratiques de la compilation. Habilitation à diriger les recherches, Université de Nice-Sophia Antipolis, École doctorale STIC, December 2001.

2000

[1] Jacques Farré and José Fortes Gálvez. A basis for looping extensions to discriminating-reverse parsing. In S. Yu and A. Paun, editors, Implementation and Applications of Automata, 5th International Conference, CIAA 2000, volume 2088 of LNCS, pages 122-134. Springer-Verlag, July 2001.
[2] Vincent Granet. Algorithmique et programmation en Java. Dunod, September 2000. XIV + 334 pages. [http ]
[3] José Fortes Gálvez and Jacques Farré. Towards a discriminating-reverse Tomita-like parser with reduced nondeterminism. Procesamiento del Lenguaje Natural, 24:111-118, September 2000.
[4] José Fortes Gálvez and Jacques Farré. Towards a discriminating-reverse Tomita-like parser with reduced nondeterminism. In XVI Congreso de la SEPLN, Vigo, Espagne, September 2000.
[5] Jacques Farré and José Fortes Gálvez. Suboptimal solutions for extended discriminating-reverse parsing. In BCTCS'16 - British Colloqium on Theoretical Computer Science, Liverpool, Royaume-Uni, April 2000.
[6] Jacques Farré. Discriminant reverse LR parsing of context-free grammars. In IWPT 2000 - International Workshop on Parsing Technologies, Trento, Italie, February 2000. Poster.
[7] Luc Jeandenans, François Grize, and Michel Gautero. Tableau de bord pour l'intégration d'applications distribuées sur le réseau. In Nîmes TIC'2000, September 2000.
[8] José Fortes Gálvez. A Discriminating Reverse Approach to LR(k) Parsing. Thèse de doctorat, Université de Nice-Sophia Antipolis, École doctorale STIC, January 1999. [.ps.gz ]


Airelles