An HPSG-to-CFG approximation of Japanese

Authors:
Bernd Kiefer;Hans-Ulrich Krieger;Melanie Siegel
Affiliations:
German Research Center for Artificial Intelligence (DFKI), Saarbrücken;German Research Center for Artificial Intelligence (DFKI), Saarbrücken;German Research Center for Artificial Intelligence (DFKI), Saarbrücken
Venue:
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Year:
2000

Citing 3
Cited 2

From Word Hypotheses to Logical Form: An Efficient Interleaved Approach

Natural Language Processing and Speech Technology, Results of the 3rd KONVENS Conference
Using restriction to extend parsing algorithms for complex-feature-based formalisms

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
A bag of useful techniques for efficient and robust parsing

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics

A novel disambiguation method for unification-based grammars using probabilistic context-free approximations

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
A context-free superset approximation of unification-based grammars

New developments in parsing technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple approximation method for turning a Head-Driven Phrase Structure Grammar into a context-free grammar. The approximation method can be seen as the construction of the least fixpoint of a certain monotonic function. We discuss an experiment with a large HPSG for Japanese.