Towards case-based parsing : are chunks reliable indicators for syntax trees?

  • This paper presents an approach to the question whether it is possible to construct a parser based on ideas from case-based reasoning. Such a parser would employ a partial analysis of the input sentence to select a (nearly) complete syntax tree and then adapt this tree to the input sentence. The experiments performed on German data from the Tüba-D/Z treebank and the KaRoPars partial parser show that a wide range of levels of generality can be reached, depending on which types of information are used to determine the similarity between input sentence and training sentences. The results are such that it is possible to construct a case-based parser. The optimal setting out of those presented here need to be determined empirically.

Download full text files

Export metadata

Author:Sandra KüblerORCiDGND
Document Type:Preprint
Year of Completion:2006
Year of first Publication:2006
Publishing Institution:Universitätsbibliothek Johann Christian Senckenberg
Release Date:2008/11/03
Page Number:9
Erschienen in: Proceedings of the Workshop on Linguistic Distances, Sydney, Australia — July 23 - 23, 2006, Stroudsburg, PA, USA : Association for Computational Linguistics, 2006, S. 73-81, ISBN: 1-932432-83-3
Source: ; Proceedings of the COLING/ACL Workshop on Linguistic Distances - Sydney, Australia, July 2006.
Institutes:keine Angabe Fachbereich / Extern
Dewey Decimal Classification:4 Sprache / 40 Sprache / 400 Sprache
Licence (German):License LogoDeutsches Urheberrecht