16430 search results - page 407 / 3286 » On Computable Tree Functions |
159
click to vote
LPAR
2005
Springer
16 years 9 days ago
2005
Springer
We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. C...
177
click to vote
TSD
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. A formal prosody model is proposed together with its application in a text-to-speech system. The model is based on a generative of abstract prosodic functionally involved...
148
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
The automation of forest cleaning presupposes principles for choosing those trees that ought to be taken away and those that shall be left standing. In this paper, which is a repor...
147
click to vote
ACL
2003
15 years 8 months ago
2003
We introduce a MetaGrammar, which allows us to automatically generate, from a single and compact MetaGrammar hierarchy, parallel Lexical Functional Grammars (LFG) and Tree-Adjoini...
181
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...