Demo Data from EDBT 2026 / reviewers in the wild / expert
Nobo Komagata
dblp:09/398
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2004
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author
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% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages
categorial grammar |
0.0 | 1 | 1997 | Generative Power of CCGs with Generalized Type-Raised Categories · ACL 1997 |
Automata and formal languages › categorial grammar
combinatory categorial grammar |
0.0 | 1 | 1997 | Generative Power of CCGs with Generalized Type-Raised Categories · ACL 1997 |
Automata and formal languages › grammar formalisms
generative capacity |
0.0 | 1 | 1997 | Generative Power of CCGs with Generalized Type-Raised Categories · ACL 1997 |
Methods — techniques the papers use, named apart from their topics
type raising · 0.0grammar simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | A solution to the spurious ambiguity problem for practical Combinatory Categorial Grammar parsers
Nobo Komagata |
Comput. Speech Lang. | 1 |
| 1997 | Generative Power of CCGs with Generalized Type-Raised CategoriesabstractThis paper shows that a class of Combinatory Categorial Grammars (CCGs) augmented with a linguistically-motivated form of type raising involving variables is weakly equivalent to the standard CCGs not involving variables. The proof is based on the idea that any instance of such a grammar can be simulated by a standard CCG. Nobo Komagata |
ACL | 1 |