An earley parsing algorithm for range concatenation grammars

  • We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing framework. The characteristic property of the Earley parser is that we use a technique of range boundary constraint propagation to compute the yields of non-terminals as late as possible. Experiments show that, compared to previous approaches, the constraint propagation helps to considerably decrease the number of items in the chart.

Download full text files

Export metadata

Metadaten
Author:Laura KallmeyerORCiDGND, Wolfgang Maier, Yannick Parmentier
URN:urn:nbn:de:hebis:30-1135108
URL:http://www.sfs.uni-tuebingen.de/~lk/papers/KallmMaierParm-ACL09.pdf
Editor:Keh-Yih Su, Jian Su, Janyce Wiebe, Haizhou Li
Document Type:Preprint
Language:English
Year of Completion:2009
Year of first Publication:2009
Publishing Institution:Universitätsbibliothek Johann Christian Senckenberg
Release Date:2009/10/27
Tag:Range Concatenation Grammar
GND Keyword:Algorithmus
Page Number:4
Note:
Erschienen in: Keh-Yih Su ; Jian Su ; Janyce Wiebe ; Haizhou Li (Hrsg.): Proceedings of the ACL-IJCNLP 2009 Conference Short Papers, Suntec, Singapore : Association for Computational Linguistics, 2009, S. 9-12
Source:http://www.sfs.uni-tuebingen.de/~lk/papers/KallmMaierParm-ACL09.pdf ; (in:) Proceedings of ACL. - Singapore, 2009
HeBIS-PPN:219867801
Institutes:keine Angabe Fachbereich / Extern
Dewey Decimal Classification:4 Sprache / 40 Sprache / 400 Sprache
Sammlungen:Linguistik
Linguistik-Klassifikation:Linguistik-Klassifikation: Syntax
Licence (German):License LogoDeutsches Urheberrecht