Pomset mcfgs

Authors:
Michael J. Pan
Affiliations:
University of California, Los Angeles
Venue:
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Year:
2007

Citing 9
Cited 0

Modeling concurrency with partial orders

International Journal of Parallel Programming
On multiple context-free grammars

Theoretical Computer Science
Complexity results for POMSET languages

SIAM Journal on Discrete Mathematics
Shuffle languages, Petri nets, and context-sensitive grammars

Communications of the ACM
Series-parallel languages and the bounded-width property

Theoretical Computer Science
Derivational Minimalism

LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Long-distance scrambling and tree adjoining grammars

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
IDL-expressions: a formalism for representing and parsing finite languages in natural language processing

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper identifies two orthogonal dimensions of context sensitivity, the first being context sensitivity in concurrency and the second being structural context sensitivity. We present an example from natural language which seems to require both types of context sensitivity, and introduce partially ordered multisets (pomsets) mcfgs as a formalism which succintly expresses both.