Yusuke Miyao
Yusuke Miyao wrote 8 of the papers Mova reads, in 2005–2020, most of them on Dependency parsing, Universal Dependencies, Treebanks; often with Jun'ichi Tsujii, Tadayoshi Hara, Baye Yimam Mekonnen.
OpenAlex · ORCID · h-index 35 · 4576 citations · 263 works — openalex, 2026-10-18
Topics: Dependency parsing 1 · Universal Dependencies 1 · Treebanks 1 · Part-of-speech tagging 1
Papers
- Comparing Neural Network Parsers for a Less-resourced and Morphologically-rich Language: Amharic Dependency Parser (2020)
The paper compares four off-the-shelf neural dependency parsers (UDPipe, jPTDP, UUParser, Turku) on the Amharic UD treebank, which has about 1,074 manually annotated sentences. - Universal Dependencies for Amharic (2018)
The first UD treebank of Amharic, an Ethio-Semitic language: 1,096 sentences, 8,025 tokens (clitics not counted), taken mainly from grammar books, plus fiction, biographies, religious texts and news, hand-corrected for spelling. - Exploring Difficulties in Parsing Imperatives and Questions (2011)
Parsers trained on the Wall Street Journal fail on imperatives and questions even when the words are known, because the word order and the missing subject change the structure. - Descriptive and Empirical Approaches to Capturing Underlying Dependencies among Parsing Errors (2009)
Parser errors are usually counted one by one, but one wrong decision often causes several errors. The authors look for these underlying dependencies in two ways. The descriptive approach defines combinations of error patterns, such as argument inconsistencies around a verb, and extracts them from the errors. The… - Effective Analysis of Causes and Inter-dependencies of Parsing Errors (2009)
F-scores hide where a parser fails and how its errors depend on each other. The authors analyse errors of the Enju HPSG parser on predicate-argument triplets in two ways. First, 14 hand-written pattern rules map sets of mismatched triplets to cause categories such as PP-attachment, coordination, relative-clause… - Feature Forest Models for Probabilistic HPSG Parsing (2008)
Probabilistic models for lexicalized grammars are hard because their structures are typed feature structures, not trees or lattices. - Task-oriented Evaluation of Syntactic Parsers and Their Representations (2008)
Parsers are usually compared on their own accuracy, and parse representations differ from framework to framework, so the scores are hard to compare. - Probabilistic Disambiguation Models for Wide-Coverage HPSG Parsing (2005)
The paper builds log-linear disambiguation models for a wide-coverage HPSG grammar, trained on 20 sections of the Penn Treebank.
Co-authors (7)
- Jun'ichi Tsujii ×6
- Tadayoshi Hara ×3
- Baye Yimam Mekonnen ×2
- Binyam Ephrem Seyoum ×2
- Takuya Matsuzaki ×2
- Kenji Sagae
- Rune Sætre
This page in Markdown → https://md.mova.elamur.ai/free/en/docs/papers/authors/yusuke-miyao/