268 search results - page 17 / 54 » Linear Context Free Languages |
WCRE
1997
IEEE
13 years 11 months ago
1997
IEEE
We present an approach for the generation of components for a software renovation factory. These components are generated from a context-free grammar definition that recognizes t...
COLING
2000
13 years 8 months ago
2000
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
ACL
1993
13 years 8 months ago
1993
This paper introduces a tree generating system called Lexicalized Context-Free Grammar (LCFG) and describes a cubic-time parser for it. LCFG embeds the elegance of the analyses fo...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
DLT
2004
13 years 8 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...