212 search results - page 4 / 43 » Second-Order Simple Grammars |
ACL
2012
13 years 3 days ago
2012
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
ALT
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
JOLLI
2010
14 years 8 months ago
2010
embership problem for non-linear Abstract Categorial Grammars Sylvain Salvati Abstract In this paper we show that the membership problem for second order nonbstract Categorial Gram...
136
click to vote
CPP
2011
13 years 9 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
LOGCOM
2008
14 years 9 months ago
2008
This paper defines the grammar class of sequentially indexed grammars (SIGs) that results of a change in the index stack handling mechanism of indexed grammars [Aho68, Aho69]. SIG...