Lexicalisation of grammars with parameterized graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2005

Lexicalisation of grammars with parameterized graphs

Olivier Blanc
  • Function : Author
  • PersonId : 921905
Mathieu Constant

Abstract

This paper is about the use of a large-coverage syntactic lexicon for text parsing. Our work focuses on the construction of a lexicalized unification grammar using the fine-grained syntactic information encoded in the lexicon-grammar tables built at LADL (France). We present a method to generate this grammar from a hand-built meta-grammar composed of parameterized graphs. For each lexical item in our lexicon, a specialized grammar is generated by resolving the parameters referring to syntactic properties encoded in the lexicon-grammar tables. We also show that our method can be adapted to a more complex lexicon in the form of relational tables.
Fichier principal
Vignette du fichier
blanc-constant-RANLP2005.pdf (217.1 Ko) Télécharger le fichier
Origin : Publication funded by an institution

Dates and versions

hal-00621640 , version 1 (17-11-2021)

Identifiers

  • HAL Id : hal-00621640 , version 1

Cite

Olivier Blanc, Mathieu Constant. Lexicalisation of grammars with parameterized graphs. International Conference of Recent Advances in Natural Language Processing (RANLP'05), 2005, Borovets, Bulgaria. pp.117-121. ⟨hal-00621640⟩
126 View
6 Download

Share

Gmail Facebook Twitter LinkedIn More