CKY Algorithm
Related Papers
Polynomial Time Parsing of Combinatory Categorial Grammars
In this paper we present a polynomial time pars- ing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating a representation …...
Efficient Combinatory Categorial Grammar Parsing
Efficient wide-coverage parsing is integral to large-scale NLP applications. Unfortu- nately, parsers for linguistically motivated formalisms, e.g. HPSG and TAG, are often too inefficient for these applications. This paper describes …...
Protein folding and chart parsing
How can proteins fold so quickly into their unique native structures? We show here that there is a natural analogy between parsing and the protein folding problem, and demonstrate that …...
Semantic Dependency Parsing using N-best Semantic Role Sequences and Roleset Information
In this paper, we describe a syntactic and semantic dependency parsing system sub- mitted to the shared task of CoNLL 2008. The proposed system consists of five mod- ules: syntactic …...
Chinese Discourse Parsing: Model and Evaluation
AbstractChinese discourse parsing, which aims to identify the hierarchical relationships of Chinese elementary discourse units, has not yet a consistent evaluation metric. Although Parseval is commonly used, variations of evaluation …...