Results 271 to 280 of about 25,771 (294)

On Implementation of Tree Synchronized Languages

1999
Tree 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

2009
The 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

Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages

2011
Minimalist grammars are a mildly context-sensitive grammar framework within which analyses in mainstream chomskyian syntax can be faithfully represented. Here it is shown that both the derivation tree languages and derived tree languages of minimalist grammars are closed under intersection with regular tree languages.
openaire   +1 more source

Suffix Trees as Language Models.

2023
Suffix 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, Kay, Martin, Friedrich, Annemarie   +2 more
openaire   +2 more sources

Principal abstract families of weighted tree languages

Information and Computation, 2022
Zoltan Fülöp, Heiko Vogler
exaly  

Generalized definite tree languages

1989
A word language L is called generalized definite iff the membership of a word w in L depends only on the suffix and the prefix of w of fixed length. In an analogous way we introduce generalized definite tree languages where (viewing trees bottom-up) the prefix of length k is replaced by the set of "frontier-trees" of height less or equal than k and the
openaire   +1 more source

Language trees not equal gene trees.

Theory in biosciences = Theorie in den Biowissenschaften, 2011
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 ...
James, Steele, Anne, Kandler
openaire   +1 more source

Semigroups of Terms, Tree Languages, Menger Algebra of n-Ary Functions and Their Embedding Theorems

Symmetry, 2021
Thodsaporn Kumduang, Sorasak Leeratanavalee   +1 more
exaly  

Tree-Walking Automata Do Not Recognize All Regular Languages

SIAM Journal on Computing, 2008
Mikołaj Bojanczyk
exaly  

Algebraic recognizability of regular tree languages

Theoretical Computer Science, 2005
Zoltan Ésik, Pascal Weil
exaly