Abstract automata and a normal form for categorial dependency grammars

Authors:
Boris Karlov
Affiliations:
Tver State Universty, Tver, Russia
Venue:
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Year:
2012

Citing 5
Cited 1

A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

Journal of the ACM (JACM)
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Greibach Normal Form Transformation, Revisited

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Grammars for local and long dependencies

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Generalized categorial dependency grammars

Pillars of computer science

Categorial grammars with iterated types form a strict hierarchy of k-valued languages

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Categorial Dependency Grammars (CDG) studied in this paper are categorial grammars expressing projective and discontinuous dependencies, stronger than cf-grammars and presumably nonequivalent to mild context-sensitive grammars. We define a normal form of CDG similar to Greibach normal form for cf-grammars and propose an effective algorithm which transforms any CDG into an equivalent CDG in the normal form. A class of push-down automata with independent counters is defined and it is proved that they accept the class of CDG-languages. We present algorithms that transform any CDG into an automaton and vice versa.