877 search results - page 10 / 176 » How to Cover a Grammar |
GRAMMARS
2000
13 years 7 months ago
2000
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the ...
COLING
1990
13 years 8 months ago
1990
In machine translation, parsing of long English sentences still causes some problems, whereas for short sentences a good machine translation system usually can generate readable t...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract-- This work furthers the understanding of modularity in grammar-based genetic programming approaches by analyzing how different grammars may be capable of producing the sa...
RIA
2006
13 years 7 months ago
2006
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
BALT
2010
13 years 2 months ago
2010
For the purposes of tool development, computer languages are usually described using context-free grammars with annotations such as semantic actions or pretty-printing instructions...