Les corpus sont tres` utiles pour de nombreuses tˆaches dans le domaine du traitement automa-tique des langues naturelles. Les corpus annot´es syntaxiquement sont devenus une ressourceimportante en TAL. Ils sont couramment utilis´es, par exemple comme banc d’essai pour lagen´ ´eration, l’analyse et la desambigu´ ¨isation semantique,´ et comme source pour l’acquisitionde ressources (collocations, information sur la sous-categorisation,´ extraction de grammaire).Lorsqu’on utilise les structures de d´ependance pour le TAL, le manque de corpus annotes´ enstructures de dependance´ constitue un handicap. Nous presentons´ une approche fond´ee surune grammaire de graphes pour convertir des corpus annot´es en structures syntagmatiques encorpus annotes´ en dependances.´ Cette approche fonctionne pour des langues a` ordre de mots(partiellement) libre et fixe.Corpora are very useful for many tasks in the area of natural language processing. Syntacticallyannotated corpora became an important resource in NLP. They are widely used, for example astest bed for generation and parsing, word sense disambiguation, as source for the acquisitionof resources (e.g. collocations, subcategorization information, grammar extraction). When oneuses dependency structures for NLP, the lack of corpora annotated by dependency structures isa handicap. We will present a graph grammar approach to map corpora annotated by phrasestructures into corpora annotated by dependency structures. The approach works for (partially)free and fixed word order languages.
[1]
Igor Mel’čuk,et al.
Surface syntax of English
,
1986
.
[2]
Michael Collins,et al.
Three Generative, Lexicalised Models for Statistical Parsing
,
1997,
ACL.
[3]
Fei Xia,et al.
Converting Dependency Structures to Phrase Structures
,
2001,
HLT.
[4]
Leo Wanner,et al.
A development Environment for an MTT-Based Sentence Generator
,
2000,
INLG.
[5]
Michael Collins,et al.
Three Generative, Lexicalised Models for Statistical Parsing
,
1997,
ACL.
[6]
Dekang Lin,et al.
A dependency-based method for evaluating broad-coverage parsers
,
1995,
Natural Language Engineering.
[7]
DFKI GmbH Stuhlsatzenhausweg.
Treebank Conversion – Converting the NEGRA treebank to an LTAG grammar –
,
2001
.
[8]
Leo Wanner,et al.
On Using a Parallel Graph Rewriting Formalism in Generation
,
2001,
EWNLG@ACL.
[9]
David M. Magerman.
Natural Language Parsing as Statistical Pattern Recognition
,
1994,
ArXiv.
[10]
Fei Xia,et al.
Automatic grammar generation from two different perspectives
,
2001
.
[11]
Wojciech Skut,et al.
An Annotation Scheme for Free Word Order Languages
,
1997,
ANLP.
[12]
Grzegorz Rozenberg,et al.
Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations
,
1997
.