Learning XML Grammars

Fernau, Henning

doi:10.1007/3-540-44596-x_7

Cited by 22 publications

(12 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When substituting the notations (11) this expression becomes β((z 1 z 2 ) r z 1 z 3 ) * (z 1 z 2 ) r+1 (z 1 z 2 ) * γ = β(z 1 z 2 ) r z 1 (z 3 (z 1 z 2 ) r z 1 ) * z 2 (z 1 z 2 ) * γ . (13) If z 3 = λ, and recalling that z 2 = λ, lcp(z 2 , z 3 ) = λ, the right-hand side of (13) satisfies (6) and there we have reduced the largest index of consecutive stars.…”

Section: Proof First Assume That L(a)mentioning

confidence: 92%

Deciding determinism of caterpillar expressions

Salomaa

Yü

Zan

2009

Theoretical Computer Science

View full text Add to dashboard Cite

a b s t r a c tCaterpillar expressions have been introduced by Brüggemann-Klein and Wood for applications in markup languages. Caterpillar expressions provide a convenient formalism for specifying the operation of tree-walking automata on unranked trees. Here we give a formal definition of determinism of caterpillar expressions that is based on the language of instruction sequences defined by the expression. We show that determinism of caterpillar expressions can be decided in polynomial time.

show abstract

Section: Proof First Assume That L(a)mentioning

confidence: 92%

Deciding determinism of caterpillar expressions

Salomaa

Yü

Zan

2009

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…The rise of XML has lead to some new challenges for the field (Fernau points out some of these in [183]). Chiidlovski obtains some preliminary results by using context free grammar learning techniques [184].…”

Section: Document Managementmentioning

confidence: 98%

A bibliographical study of grammatical inference

Higuera

2005

Pattern Recognition

175

View full text Add to dashboard Cite

“…Ignoring attributes, DTDs can be seen as restricted context-free grammars and have been studied by Berstel and Boasson under the name XML grammars [23]. The application of grammatical inference techniques for learning XML grammars was investigated by Fernau [74]. The author showed that although the full class of XML languages is not learnable in the limit from positive samples, the subclass of f -distinguishable languages is Bex et al later added the subclass of DTDs that can be described using the class of single-occurrence regular expressions in which every element name occurs at most once [25].…”

Section: Learning Xml Schemamentioning

confidence: 99%

Learning Tree Languages

Björklund

Fernau

2016

Topics in Grammatical Inference

Self Cite

View full text Add to dashboard Cite

Tree languages have proved to be a versatile and rewarding extension of the classical notion of string languages. Many nice applications have been established over the years, in areas such as Natural Language Processing, Information Extraction, and Computational Biology. Although some properties of string languages transfer easily to the tree case, in particular for regular languages, several computational aspects turn out to be harder. It is therefore both of theoretical and of practical interest to investigate how far and in what ways Grammatical Inference algorithms developed for the string case are applicable to trees. This chapter surveys known results in this direction. We begin by recalling the basics of tree language theory. Then, the most popular learning scenarios and algorithms are presented. Several applications of Grammatical Inference of tree languages are reviewed in some detail. We conclude by suggesting a number of directions for future research.

show abstract

Learning XML Grammars

Cited by 22 publications

References 22 publications

Deciding determinism of caterpillar expressions

Deciding determinism of caterpillar expressions

A bibliographical study of grammatical inference

Learning Tree Languages

Contact Info

Product

Resources

About