Graph-based and transition-based approaches to dependency parsing adopt very different views of the problem, each view having its own strengths and limitations. We study both appr...
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
This paper describes an annotation guideline for a temporal relation-tagged corpus of Chinese. Our goal is construction of corpora to be used for a corpus-based analysis of tempor...
Previous studies in data-driven dependency parsing have shown that tree transformations can improve parsing accuracy for specific parsers and data sets. We investigate to what ex...
Data-driven learning based on shift reduce parsing algorithms has emerged dependency parsing and shown excellent performance to many Treebanks. In this paper, we investigate the e...