The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
We implement a Korean syntactic analyzer which decreases many ambiguities in syntax parse trees using segmentation and semantic connection units. We use dependency grammar for par...
Recently, dependency grammar has become quite popular in relatively free word-order languages. We encounter many structural ambiguities when parsing a sentence using dependency gr...
Spoken monologues feature greater sentence length and structural complexity than do spoken dialogues. To achieve high parsing performance for spoken monologues, it could prove eff...