Skip to Main content Skip to Navigation

Exact Grammaticality Judgement of Likely Parse Tree

Abstract : The robustness of probabilistic parsing generally comes at the expense of grammaticality judgementthe grammaticality of the most probable output parse remaining unknown. Parsers, such as the Stanford or the Reranking ones, can not discriminate between grammatical and ungrammatical probable parses, whether their surface realisations are themselves grammatical or not. In this paper we show that a Model-Theoretic representation of Syntax alleviates the grammaticality judgement on a parse tree. In order to demonstrate the practicality and usefulness of an alliance between stochastic parsing and knowledgebased representation, we introduce an exact method for putting a binary grammatical judgement on a probable phrase structure. We experiment with parse trees generated by a probabilistic parser. We show experimental evidence on parse trees generated by a probabilistic parser to confirm our hypothesis.
Complete list of metadata
Contributor : Jean-Philippe Prost Connect in order to contact the contributor
Submitted on : Wednesday, February 9, 2022 - 7:09:49 PM
Last modification on : Friday, February 11, 2022 - 3:41:23 AM
Long-term archiving on: : Tuesday, May 10, 2022 - 7:21:32 PM


Files produced by the author(s)


  • HAL Id : hal-03563629, version 1



Jean-Philippe Prost. Exact Grammaticality Judgement of Likely Parse Tree. [Research Report] Lirmm, University of Montpellier. 2014. ⟨hal-03563629⟩



Record views


Files downloads