Erik Aarts

Fixing paper assignments

  1. Please select all papers that belong to the same person.
  2. Indicate below which author they should be assigned to.
Provide a valid ORCID iD here. This will be used to match future papers to this author.
Provide the name of the school or the university where the author has received or will receive their highest degree (e.g., Ph.D. institution for researchers, or current affiliation for students). This will be used to form the new author page ID, if needed.

TODO: "submit" and "cancel" buttons here

1995

pdf bib
Acyclic Context-sensitive Grammars
Erik Aarts
Proceedings of the Fourth International Workshop on Parsing Technologies

A grammar formalism is introduced that generates parse trees with crossing branches. The uniform recognition problem is NP-complete, but for any fixed grammar the recognition problem is polynomial.

1992

pdf bib
Uniform Recognition for Acyclic Context-Sensitive Grammars is NP-complete
Erik Aarts
COLING 1992 Volume 4: The 14th International Conference on Computational Linguistics

Search
Co-authors
    Venues
    Fix data