Article

Free access

Combining deep and shallow approaches in parsing German

Author:

Michael SchiehlenAuthors Info & Claims

ACL '03: Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1

Pages 112 - 119

https://doi.org/10.3115/1075096.1075111

Published: 07 July 2003 Publication History

Abstract

The paper describes two parsing schemes: a shallow approach based on machine learning and a cascaded finite-state parser with a hand-crafted grammar. It discusses several ways to combine them and presents evaluation results for the two individual approaches and their combination. An underspecification scheme for the output of the finite-state parser is introduced and shown to improve performance.

References

[1]

Steven Abney. 1991. Parsing by Chunks. In Robert C. Berwick, Steven P. Abney, and Carol Tenny, editors, Principle-based Parsing: computation and psycholinguistics, pages 257--278. Kluwer, Dordrecht.

[2]

Adam Berger, Stephen Della Pietra, and Vincent Della Pietra. 1996. A maximum entropy approach to natural language processing. Computational Linguistics, 22(1):39--71, March.

Digital Library

[3]

E. Black, S. Abney, D. Flickinger, C. Gdaniec, R. Grishman, P. Harrison, D. Hindle, R. Ingria, F. Jelinek, J. Klavans, M. Liberman, M. Marcus, S. Roukos, B. Santorini, and T. Strzalkowski. 1991. A procedure for quantitatively comparing the syntactic coverage of English grammars. In Proceedings of the DARPA Speech and Natural Language Workshop 1991, Pacific Grove, CA.

Digital Library

[4]

John Carroll, Ted Briscoe, and Antonio Sanfilippo. 1998. Parser Evaluation: a Survey and a New Proposal. In Proceedings of LREC, pages 447--454, Granada.

[5]

Jochen Dörre. 1997. Efficient Construction of Underspecified Semantics under Massive Ambiguity. ACL'97, pages 386--393, Madrid, Spain.

[6]

Jason M. Eisner. 1996. Three new probabilistic models for dependency parsing: An exploration. COLING '96, Copenhagen.

Digital Library

[7]

David Elworthy, Tony Rose, Amanda Clare, and Aaron Kotcheff. 2001. A natural language system for retrieval of captioned images. Journal of Natural Language Engineering, 7(2):117--142.

Digital Library

[8]

Haim Gaifman. 1965. Dependency Systems and Phrase-Structure Systems. Information and Control, 8(3):304--337.

[9]

Sandra Külber and Heike Telljohann. 2002. Towards a Dependency-Oriented Evaluation for Partial Parsing. In Beyond PARSEVAL -- Towards Improved Evaluation Measures for Parsing Systems (LREC Workshop).

[10]

Dekang Lin. 1995. A Dependency-based Method for Evaluating Broad-Coverage Parsers. In Proceedings of the IJCAI-95, pages 1420--1425, Montreal.

Digital Library

[11]

John T. Maxwell III and Ronald M. Kaplan. 1989. An overview of disjunctive constraint satisfaction. In Proceedings of the International Workshop on Parsing Technologies, Pittsburgh, PA.

[12]

Judita Preiss. 2003. Using Grammatical Relations to Compare Parsers. EACL'03, Budapest.

Digital Library

[13]

J. Ross Quinlan. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA.

Digital Library

[14]

Stefan Riezler, Tracy H. King, Ronald M. Kaplan, Richard Crouch, John T. Maxwell III, and Mark Johnson. 2002. Parsing the Wall Street Journal using a Lexical-Functional Grammar and Discriminative Estimation Techniques. ACL'02, Philadelphia.

Digital Library

[15]

Jane J. Robinson. 1970. Dependency Structures and Transformational Rules. Language, 46:259--285.

[16]

Michael Schiehlen. 2002. Experiments in German Noun Chunking. COLING'02, Taipei.

Digital Library

[17]

Michael Schiehlen. 2003. A Cascaded Finite-State Parser for German. Research Note in EACL'03.

Digital Library

[18]

Wojciech Skut, Brigitte Krenn, Thorsten Brants, and Hans Uszkoreit. 1997. An Annotation Scheme for Free Word Order Languages. ANLP-97, Washington.

Digital Library

[19]

Lucien Tesnière. 1959. Elements de syntaxe structurale. Librairie Klincksieck, Paris.

[20]

Lei Xu, Adam Krzyzak, and Ching Y. Suen. 1992. Several Methods for Combining Multiple Classifiers and Their Applications in Handwritten Character Recognition. IEEE Trans. on System, Man and Cybernetics, SMC-22(3):418--435.

Cited By

Blessing ASchütze HJoshi AHuang CJurafsky D(2010)Self-annotation for fine-grained geospatial relation extractionProceedings of the 23rd International Conference on Computational Linguistics10.5555/1873781.1873791(80-88)Online publication date: 23-Aug-2010
https://dl.acm.org/doi/10.5555/1873781.1873791
Schiehlen MSpranger KMarquez LKlein D(2006)Language independent probabilistic context-free parsing bolstered by machine learningProceedings of the Tenth Conference on Computational Natural Language Learning10.5555/1596276.1596320(231-235)Online publication date: 8-Jun-2006
https://dl.acm.org/doi/10.5555/1596276.1596320
Schiehlen M(2004)Optimizing algorithms for pronoun resolutionProceedings of the 20th international conference on Computational Linguistics10.3115/1220355.1220429(515-es)Online publication date: 23-Aug-2004
https://dl.acm.org/doi/10.3115/1220355.1220429
Show More Cited By

Combining deep and shallow approaches in parsing German

Recommendations

Topological field parsing of German
ACL '09: Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1

Freer-word-order languages such as German exhibit linguistic phenomena that present unique challenges to traditional CFG parsing. Such phenomena produce discontinuous constituents, which are not naturally modelled by projective phrase structure trees. ...
LLLR parsing
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied Computing

The idea of an LLLR parsing is presented. An LLLR(k) parser can be constructed for any LR(k) grammar but it produces the left parse of the input string in linear time (in respect to the length of the derivation) without backtracking. If used as a basis ...
Parsing three German treebanks: lexicalized and unlexicalized baselines
PaGe '08: Proceedings of the Workshop on Parsing German

Previous work on German parsing has provided confusing and conflicting results concerning the difficulty of the task and whether techniques that are useful for English, such as lexicalization, are effective for German. This paper aims to provide some ...

Comments

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

ACL '03: Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1

July 2003

571 pages

Program Chairs:
Erhard W. Hinrichs,
Dan Roth

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 07 July 2003

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 85 of 443 submissions, 19%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
223
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)4

Reflects downloads up to 10 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Blessing ASchütze HJoshi AHuang CJurafsky D(2010)Self-annotation for fine-grained geospatial relation extractionProceedings of the 23rd International Conference on Computational Linguistics10.5555/1873781.1873791(80-88)Online publication date: 23-Aug-2010
https://dl.acm.org/doi/10.5555/1873781.1873791
Schiehlen MSpranger KMarquez LKlein D(2006)Language independent probabilistic context-free parsing bolstered by machine learningProceedings of the Tenth Conference on Computational Natural Language Learning10.5555/1596276.1596320(231-235)Online publication date: 8-Jun-2006
https://dl.acm.org/doi/10.5555/1596276.1596320
Schiehlen M(2004)Optimizing algorithms for pronoun resolutionProceedings of the 20th international conference on Computational Linguistics10.3115/1220355.1220429(515-es)Online publication date: 23-Aug-2004
https://dl.acm.org/doi/10.3115/1220355.1220429
Schiehlen M(2004)Annotation strategies for probabilistic parsing in GermanProceedings of the 20th international conference on Computational Linguistics10.3115/1220355.1220411(390-es)Online publication date: 23-Aug-2004
https://dl.acm.org/doi/10.3115/1220355.1220411
Müller F(2004)Annotating grammatical functions for German using finite-state cascadesProceedings of the 20th international conference on Computational Linguistics10.3115/1220355.1220394(268-es)Online publication date: 23-Aug-2004
https://dl.acm.org/doi/10.3115/1220355.1220394

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten