A polynomial-time parsing algorithm for TT-MCTAG

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Notes: In: Preprint, erschienen in: 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 2, Stroudsburg, PA : Association for Computational Linguistics, 2009, S. 994–1002, ISBN: 978-1-932432-46-6

Classification: Sprache, Linguistik

Keyword: Syntaktische Analyse

Event: Veröffentlichung

(where): Frankfurt am Main

(who): Universitätsbibliothek Johann Christian Senckenberg

(when): 2009

Creator: Kallmeyer, Laura
Satta, Giorgio

URN: urn:nbn:de:hebis:30-1135111

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 15.08.2025, 7:28 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Kallmeyer, Laura
Satta, Giorgio
Universitätsbibliothek Johann Christian Senckenberg

Time of origin

2009

Other Objects (12)

An earley parsing algorithm for range concatenation grammars

Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality

Hochschulschrift

Polynomial time calculi

A polynomial time algorithm for computing the area under a GDT curve

A quasi-polynomial time algorithm for multi-arrival on tree-Llke multigraphs

A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits

On average polynomial time

Parsing theory, Vol. 1.. Languages and parsing

Hochschulschrift

Bidirectional parsing

Parsing coordinations

Hochschulschrift | Online-Publikation

Bidirectional parsing

Hochschulschrift

Polynomial time partial information classes

An earley parsing algorithm for range concatenation grammars

Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality

Hochschulschrift

Polynomial time calculi

A polynomial time algorithm for computing the area under a GDT curve

A quasi-polynomial time algorithm for multi-arrival on tree-Llke multigraphs

A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits

On average polynomial time

Parsing theory, Vol. 1.. Languages and parsing

Hochschulschrift

Bidirectional parsing

Parsing coordinations

Hochschulschrift | Online-Publikation

Bidirectional parsing

Hochschulschrift

Polynomial time partial information classes

An earley parsing algorithm for range concatenation grammars

Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality

Hochschulschrift

Polynomial time calculi

A polynomial time algorithm for computing the area under a GDT curve

A quasi-polynomial time algorithm for multi-arrival on tree-Llke multigraphs

A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits

On average polynomial time

Parsing theory, Vol. 1.. Languages and parsing

Hochschulschrift

Bidirectional parsing

Parsing coordinations

Hochschulschrift | Online-Publikation

Bidirectional parsing

Hochschulschrift

Polynomial time partial information classes

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

A polynomial-time parsing algorithm for TT-MCTAG

Object Details

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

An earley parsing algorithm for range concatenation grammars

Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality

Polynomial time calculi

A polynomial time algorithm for computing the area under a GDT curve

A quasi-polynomial time algorithm for multi-arrival on tree-Llke multigraphs

A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits

On average polynomial time

Parsing theory, Vol. 1.. Languages and parsing

Bidirectional parsing

Parsing coordinations

Bidirectional parsing

Polynomial time partial information classes

An earley parsing algorithm for range concatenation grammars

Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality

Polynomial time calculi

A polynomial time algorithm for computing the area under a GDT curve

A quasi-polynomial time algorithm for multi-arrival on tree-Llke multigraphs

A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits

On average polynomial time

Parsing theory, Vol. 1.. Languages and parsing

Bidirectional parsing

Parsing coordinations

Bidirectional parsing

Polynomial time partial information classes

An earley parsing algorithm for range concatenation grammars

Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality

Polynomial time calculi

A polynomial time algorithm for computing the area under a GDT curve

A quasi-polynomial time algorithm for multi-arrival on tree-Llke multigraphs

A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits

On average polynomial time

Parsing theory, Vol. 1.. Languages and parsing

Bidirectional parsing

Parsing coordinations

Bidirectional parsing

Polynomial time partial information classes

Related objects

Reset password