- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
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
- Klassifikation
-
Sprache, Linguistik
- Schlagwort
-
Syntaktische Analyse
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Universitätsbibliothek Johann Christian Senckenberg
- (wann)
-
2009
- Urheber
- URN
-
urn:nbn:de:hebis:30-1135111
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:28 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Kallmeyer, Laura
- Satta, Giorgio
- Universitätsbibliothek Johann Christian Senckenberg
Entstanden
- 2009
Ähnliche Objekte (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