Proceedings of the Workshop on Deep Linguistic Processing - DeepLP '07 2007
DOI: 10.3115/1608912.1608932
|View full text |Cite
|
Sign up to set email alerts
|

Partial parse selection for robust deep processing

Abstract: This paper presents an approach to partial parse selection for robust deep processing. The work is based on a bottom-up chart parser for HPSG parsing. Following the definition of partial parses in (Kasper et al., 1999), different partial parse selection methods are presented and evaluated on the basis of multiple metrics, from both the syntactic and semantic viewpoints. The application of the partial parsing in spontaneous speech texts processing shows promising competence of the method.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2008
2008
2012
2012

Publication Types

Select...
2
2
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…In this experiment, we used English Resource Grammar (ERG, Flickinger (2000)), a precision HPSG grammar for English. For parsing, we used PET (Callmeier, 2001), an efficient HPSG parser, together with extended partial parsing module (Zhang et al, 2007) for maximum robustness. The grammar is handcrafted and the disambiguation models are trained on Redwoods treebanks.…”
Section: Featuresmentioning
confidence: 99%
“…In this experiment, we used English Resource Grammar (ERG, Flickinger (2000)), a precision HPSG grammar for English. For parsing, we used PET (Callmeier, 2001), an efficient HPSG parser, together with extended partial parsing module (Zhang et al, 2007) for maximum robustness. The grammar is handcrafted and the disambiguation models are trained on Redwoods treebanks.…”
Section: Featuresmentioning
confidence: 99%
“…Since these rules are sometimes too restrictive and only produce a partial chart, a second stage with a permissive pcfg backbone predicts a full-spanning pseudo-derivation, and the fragmented mrs structures are extracted from these partial analyses. (Zhang et al, 2007). The fragmented mrs does not have full feature structures for all constituents because of rule conflict, otherwise it could have been parsed in the first stage.…”
Section: Parsing With Petmentioning
confidence: 99%
“…Several methods were proposed for robust analysis. Partial parse is defined in [22] as the set of intermediate passive edges of the chart whose spans are not overlapping and cover the entire input sequence. For selecting the best sequence of partial 6Fernando López-Colino, Javier Tejedor, Jordi Porta and José Colás parses, they apply the shortest-path algorithm to maximal projections, i.e., complete phrases.…”
Section: Fig 3 Transferred Dependency Tree (Left) and Its Corresponmentioning
confidence: 99%