3396 search results - page 443 / 680 » Tree representations of graphs |
205
click to vote
ICGI
1998
Springer
15 years 11 months ago
1998
Springer
In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken int...
179
click to vote
NAACL
2001
15 years 8 months ago
2001
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled a...
153
click to vote
ACL
2000
15 years 8 months ago
2000
This paper presents a restricted version of Set-Local Multi-Component TAGs Weir, 1988 which retains the strong generative capacity of Tree-Local MultiComponent TAG i.e. produces t...
151
click to vote
COLING
2000
15 years 8 months ago
2000
Previous stochastic approaches to generation do not include a tree-based representation of syntax. While this may be adequate or even advantageous for some applications, other app...
143
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...