14 search results - page 1 / 3 » Enumeration of Context-Free Languages and Related Structures |
JALC
2007
13 years 10 months ago
2007
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
CPP
2011
12 years 10 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...
ACL
1989
14 years 1 days ago
1989
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
CIE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
KCAP
2011
ACM
13 years 1 months ago
2011
ACM
Some discourse structures such as enumerative structures have typographical, punctuational and laying out characteristics which (1) make them easily identifiable and (2) convey hi...