Sciweavers

10 search results - page 1 / 2
» A Polynomial-Time Parsing Algorithm for TT-MCTAG
Sort
View
ACL
1990
13 years 5 months ago
Polynomial Time Parsing of Combinatory Categorial Grammars
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
K. Vijay-Shanker, David J. Weir
ACL
2009
13 years 2 months ago
A Polynomial-Time Parsing Algorithm for TT-MCTAG
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
Laura Kallmeyer, Giorgio Satta
GRAMMARS
2000
100views more  GRAMMARS 2000»
13 years 4 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
IPL
2008
99views more  IPL 2008»
13 years 4 months ago
A CKY parser for picture grammars
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
Stefano Crespi-Reghizzi, Matteo Pradella
ACL
2001
13 years 6 months ago
A Syntax-based Statistical Translation Model
We present a syntax-based statistical translation model. Our model transforms a source-language parse tree into a target-language string by applying stochastic operations at each ...
Kenji Yamada, Kevin Knight