S. Bangalore and A. Joshi, Supertagging: An Approach to Almost Parsing, In: Computational Linguistics, vol.25, issue.2, pp.237-265, 1999.
DOI : 10.1007/978-94-015-9470-7_11

G. Bonfante, B. Guillaume, and M. Morey, Dependency Constraints for Lexical Disambiguation. 11 Th Int, Conference on Parsing Technologies, pp.242-253, 2009.
DOI : 10.3115/1697236.1697286
URL : https://hal.archives-ouvertes.fr/inria-00440795

G. Bonfante, B. Guillaume, and G. Perrier, Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation. 20 Th Int, Conference on Computational Linguistics, pp.303-309, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00099886

G. Bonfante, J. Le-roux, and G. Perrier, Lexical disambiguation with polarities and automata. 11 Th Int. Conference on Implementation and Application of Automata, pp.281-282, 2006.
DOI : 10.1007/11812128_30
URL : https://hal.archives-ouvertes.fr/inria-00113369

P. Boullier, Supertagging: a Non-Statistical Parsing-Based Approach, Th Int. Workshop on Parsing Technologies, IWPT 2003, pp.55-66, 2003.

B. Crabbé, Représentation informatique de grammaires fortement lexicalisées : application à la grammaire d'arbres adjoints, 2005.

D. Duchier, J. Le-roux, and Y. Parmentier, The Metagrammar Compiler: An NLP Application with a Multi-paradigm Architecture, Conference Lecture Notes in Computer Science, vol.3389, pp.175-187, 2004.
DOI : 10.1007/978-3-540-31845-3_15
URL : https://hal.archives-ouvertes.fr/inria-00100264

A. Joshi and Y. Schabes, Tree-Adjoining Grammar In: Handbook of Formal Languages, pp.69-123, 1997.

J. Lambek, The Mathematics of Sentence Structure, The American Mathematical Monthly, vol.65, issue.3, pp.154-170, 1958.
DOI : 10.2307/2310058

B. Lang, RECOGNITION CAN BE HARDER THAN PARSING, Computational Intelligence, vol.13, issue.1, pp.486-494, 1994.
DOI : 10.1016/S0019-9958(67)80007-X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.6982

Y. Parmentier, K. Kallmeyer, T. Lichte, W. Maier, and J. Dellert, A Syntax-Semantics Parsing Environment for Mildly Context-Sensitive Formalisms. 9 Th Int. Workshop on Tree-Adjoining Grammar and Related Formalisms, TAG+9, pp.121-128, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00288429

G. Perrier, Interaction Grammars. 18 Th Int, Conference on Computational Linguistics, pp.600-606, 2000.
DOI : 10.3115/992730.992733
URL : https://hal.archives-ouvertes.fr/inria-00288376

G. Perrier, Désambiguisation lexicale à l'aide d'automates de polarités Rapport de recherche INRIA, p.11, 2008.

G. Xtag-research, A Lexicalized Tree- Adjoining Grammar for English, 2001.