Smoothing and compression with stochastic \(k\)-testable tree languages (Q2485083): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994904184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally testable languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial-time learnability in the limit of strictly deterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disambiguating grammars by exclusion of sub-parse trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient learning of context-free grammars from positive structural examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic inference of regular tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Ascending and Descending Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of an Open Problem on Probabilistic Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank

Latest revision as of 14:40, 10 June 2024

scientific article
Language Label Description Also known as
English
Smoothing and compression with stochastic \(k\)-testable tree languages
scientific article

    Statements

    Smoothing and compression with stochastic \(k\)-testable tree languages (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2005
    0 references
    Tree grammars
    0 references
    Stochastic models
    0 references
    Smoothing
    0 references
    Backing-off
    0 references
    Data compression
    0 references

    Identifiers