268 search results - page 11 / 54 » Linear Context Free Languages |
LICS
1993
IEEE
15 years 4 months ago
1993
IEEE
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are context free.
102
click to vote
ACL
2008
15 years 1 months ago
2008
We take a multi-pass approach to machine translation decoding when using synchronous context-free grammars as the translation model and n-gram language models: the first pass uses...
LOGCOM
2008
14 years 11 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...
CSDA
2006
14 years 12 months ago
2006
Flexible discriminant analysis (FDA) is a general methodology which aims at providing tools for multigroup non linear classification. It consists in a nonparametric version of dis...
104
click to vote
ECML
2003
Springer
15 years 5 months ago
2003
Springer
Context-free grammars cannot be identified in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...