Polynomial Time Parsing of Combinatory Categorial Grammars

doi 10.3115/981823.981824
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computational Linguistics

Related search

Informed Parsing for Coordination With Combinatory Categorial Grammar

2000English

A Polynomial Algorithm for the Membership Problem With Categorial Grammars

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1996English

Learning Discrete Categorial Grammars From Structures

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2008English

Syntactico-Semantic Learning of Categorial Grammars

1998English

Identifying Semantic Roles Using Combinatory Categorial Grammar

2003English

A Polynomial-Time Parsing Algorithm for TT-MCTAG

2009English

Abstract Categorial Parsing as Linear Logic Programming

2015English

Parsing Expression Grammars With Unordered Choices

Journal of Information Processing
2017English

Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars

1993English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy