Mark-Jan Nederhof
About
In The Last Decade
Mark-Jan Nederhof
62 papers receiving 421 citations
Peers
Comparison fields: 5 of 40
- Artificial Intelligence 461
- Computational Theory and Mathematics 183
- Molecular Biology 50
- Language and Linguistics 29
- Information Systems 25
Countries citing papers authored by Mark-Jan Nederhof
This map shows the geographic impact of Mark-Jan Nederhof's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Mark-Jan Nederhof with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark-Jan Nederhof more than expected).
Fields of papers citing papers by Mark-Jan Nederhof
This network shows the impact of papers produced by Mark-Jan Nederhof. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Mark-Jan Nederhof. The network helps show where Mark-Jan Nederhof may publish in the future.
Co-authorship network of co-authors of Mark-Jan Nederhof
This figure shows the co-authorship network connecting the top 25 collaborators of Mark-Jan Nederhof. A scholar is included among the top collaborators of Mark-Jan Nederhof based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Mark-Jan Nederhof. Mark-Jan Nederhof is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | A Probabilistic Model of Ancient Egyptian Writing. | 2 |
| 2 | Hybrid Grammars for Discontinuous Parsing | 7 |
| 3 | Computation of Infix Probabilities for Probabilistic Context-Free Grammars | 5 |
| 4 | Prefix Probability for Probabilistic Synchronous Context-Free Grammars | 3 |
| 5 | Tree Parsing with Synchronous Tree-Adjoining Grammars | 3 |
| 6 | Prefix Probabilities for Linear Context-Free Rewriting Systems | 2 |
| 7 | Automatic creation of interlinear text for philological purposes | 1 |
| 8 | 10 | |
| 9 | An alternative LR algorithm for TAGs | 4 |
| 10 | Parsing partially bracketed input | 3 |
| 11 | LEXUS, a web-based tool for manipulating lexical resources | 16 |
| 12 | Tabular Parsing | 4 |
| 13 | 9 | |
| 14 | On the Complexity of Some Extensions of RCG Parsing | 17 |
| 15 | 55 | |
| 16 | The computational complexity of the correct-prefix property for TAGs | 13 |
| 17 | 44 | |
| 18 | Solving the Correct-prefix Property for TAGs | 7 |
| 19 | Reversible Pushdown Automata and Bidirectional Parsing | 0 |
| 20 | Efficient decoration of parse forests | 3 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.