Skip to Main content Skip to Navigation

Solution Ranking for a Symbolic Parser

Abstract : Ranking is one of the methods used to improve data-driven parsers. The task of the ranker is to define a function that will assign a score to each parse candidate tree obtained in the parsing process. We want to apply such models to resolve ambiguity problems in LEOPAR, a grammar-driven parser. LEOPAR produces a high number of parse solutions especially when the size if the input sentence grows. We want to choose the most suitable solutions among the parse candidates proposed by LEOPAR. We have to notice that a scoring system exists already in LEOPAR. It is based onsome handcrafted rules. We present in this document a ranking solution for LEOPAR based on statistical techniques. The candidate parses provided by LEOPAR are used as input for our ranker. We test our approach on the Sequoia TreeBank and obtain an improvement of the system compared to the handcrafted rules.
Document type :
Master thesis
File URL :
http://docnum.univ-lorraine.fr/public/BUL_M_2013_EKEINHOR_TATIANA.pdf
Complete list of metadatas

Cited literature [51 references]  Display  Hide  Download

https://hal.univ-lorraine.fr/hal-01864774
Contributor : Memoires Ul <>
Submitted on : Thursday, August 30, 2018 - 2:30:45 PM
Last modification on : Saturday, September 15, 2018 - 1:20:10 AM

File

BUL_M_2013_EKEINHOR_TATIANA.pd...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01864774, version 1

Collections

Citation

Tatiana Ekeinhor. Solution Ranking for a Symbolic Parser. Cognitive Sciences. 2013. ⟨hal-01864774⟩

Share

Metrics

Record views

44

Files downloads

21