Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Norbert Bröker

dblp:98/5592 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 100%
Software engineering, system software, and programming languages
1 paper
Concurrent programming · 77% Programming languages and type systems · 23%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › context-free languages
recognition complexity
0.011997
The Complexity of Recognition of Linguistically Adequate Dependency Grammars · ACL 1997
Natural language and speech › Information extraction and text analysis
syntactic parsing
0.011994
Concurrent, object-oriented natural language parsing: the ParseTalk model · Int. J. Hum. Comput. Stud. 1994
Automata and formal languages › grammar formalisms
dependency grammar
0.011997
The Complexity of Recognition of Linguistically Adequate Dependency Grammars · ACL 1997
Programming languages and type systems
object-oriented programming
0.011994
Concurrent, object-oriented natural language parsing: the ParseTalk model · Int. J. Hum. Comput. Stud. 1994

Methods — techniques the papers use, named apart from their topics

object-oriented design · 0.0concurrent parsing · 0.0
YearPublicationVenuePosition
2000 The Use of Instrumentation in Grammar Engineering
Norbert Bröker
COLING1
1997 The Complexity of Recognition of Linguistically Adequate Dependency Grammars
abstract
Results of computational complexity exist for a wide range of phrase structure-based grammar formalisms, while there is an apparent lack of such results for dependency-based formalisms. We here adapt a result on the complexity of ID/LP-grammars to the dependency framework. Contrary to previous studies on heavily restricted dependency grammars, we prove that recognition (and thus, parsing) of linguistically adequate dependency grammars is NP-complete.
Peter Neuhaus, Norbert Bröker
ACL2
1994 Concurrent Lexicalized Dependency Parsing: The ParseTalk Model
Norbert Bröker, Udo Hahn, Susanne Schacht
COLING1
1994 Concurrent Lexicalized Dependency Parsing: A Behavioral View On ParseTalk Events
Susanne Schacht, Udo Hahn, Norbert Bröker
COLING3
1994 Concurrent, object-oriented natural language parsing: the ParseTalk model
Udo Hahn, Susanne Schacht, Norbert Bröker
Int. J. Hum. Comput. Stud.3