Results 221 to 230 of about 19,622 (256)
Correction to "Contrasting Seasonal Variation of Photosynthesis in Evergreen and Deciduous Tree Species From a Tropical Forest". [PDF]
Physiol Planteuropepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Pattern Recognition, 1991
Abstract Conventionally, tree languages have been studied under the restriction that a symbol may appear in a tree only with a fixed number of descendants (the rank of the symbol). This limitation runs contrary to the proposed uses of tree languages in syntactic pattern recognition and in mathematical linguistics.
exaly +2 more sources
Abstract Conventionally, tree languages have been studied under the restriction that a symbol may appear in a tree only with a fixed number of descendants (the rank of the symbol). This limitation runs contrary to the proposed uses of tree languages in syntactic pattern recognition and in mathematical linguistics.
exaly +2 more sources
Inference of Reversible Tree Languages
IEEE Transactions on Systems, Man, and Cybernetics, 2004In this paper, we study the notion of k-reversibility and k-testability when regular tree languages are involved. We present an inference algorithm for learning a k-testable tree language that runs in polynomial time with respect to the size of the sample used.
JOSÉ M Sempere, Damian Lopez
exaly +3 more sources
Theory in Biosciences, 2010
Darwin saw similarities between the evolution of species and the evolution of languages, and it is now widely accepted that similarities between related languages can often be interpreted in terms of a bifurcating descent history (‘phylogenesis’). Such interpretations are supported when the distributions of shared and unshared traits (for example, in ...
Steele, J. +1 more
openaire +2 more sources
Darwin saw similarities between the evolution of species and the evolution of languages, and it is now widely accepted that similarities between related languages can often be interpreted in terms of a bifurcating descent history (‘phylogenesis’). Such interpretations are supported when the distributions of shared and unshared traits (for example, in ...
Steele, J. +1 more
openaire +2 more sources
Tree Adjoining Languages and Multipushdown Languages
Theory of Computing Systems, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CHERUBINI, ALESSANDRA +1 more
openaire +2 more sources
Asian-European Journal of Mathematics, 2008
Sets of terms of type τ are called tree languages (see [6]). There are several possibilities to define superposition operations on sets of tree languages. On the basis of such superposition operations we define binary associative operations on tree languages and investigate the properties of the arising semigroups.
Denecke, K., Sarasit, N.
openaire +2 more sources
Sets of terms of type τ are called tree languages (see [6]). There are several possibilities to define superposition operations on sets of tree languages. On the basis of such superposition operations we define binary associative operations on tree languages and investigate the properties of the arising semigroups.
Denecke, K., Sarasit, N.
openaire +2 more sources
Suffix Trees as Language Models
Proceedings of the Language Resources and Evaluation Conference, 2012Suffix trees are data structures that can be used to index a corpus. In this paper, we explore how some properties of suffix trees naturally provide the functionality of an n-gram language model with variable n. We explain these properties of suffix trees, which we leverage for our Suffix Tree Language Model (STLM) implementation and explain how a ...
Redd Kennington, Casey +2 more
openaire +3 more sources
Categorial Grammars and Tree Languages
Journal of Logic and Computation, 2004Summary: We consider a representation of the structure of derivations in Ajdukiewicz and Lambek categorial grammars called derived trees. We define derived tree languages of those grammars based on syntactic calculi formalized in Gentzen style and in natural deduction format and examine their relation to the families of local and regular tree languages.
openaire +2 more sources
On Implementation of Tree Synchronized Languages
1999Tree languages have been extensively studied and have many applications related to the rewriting framework such as order sorted speci fications, higher order matching or unification. In this paper, we focus on the implementation of such languages and, inspired by the Definite Clause Grammars that allows to write word grammars as Horn clauses in a ...
Frédéric Saubion, Igor Stéphan
openaire +1 more source
On the Complexity of the Syntax of Tree Languages
2009The syntactic complexity of a tree language is defined according to the number of the distinct syntactic classes of all trees with a fixed yield length. This leads to a syntactic classification of tree languages and it turns out that the class of recognizable tree languages is properly contained in that of languages with bounded complexity.
Symeon Bozapalidis, Antonios Kalampakas
openaire +1 more source