Results 21 to 30 of about 349 (84)
, 2016 In this paper we introduce Latent Tree Language Model (LTLM), a novel approach to language modeling that encodes syntax and semantics of a given sentence as a tree of word roles.
Brychcin, Tomas
core +1 more source
Parsing of Adaptive Star Grammars [PDF]
, 2006 In a recent paper, adaptive star grammars have been proposed as an extension of node and hyperedge replacement grammars. A rule in an adaptive star grammar is actually a rule schema which, via the so-called cloning operation, yields a potentially ...
Minas, Mark
core +2 more sources
Optimal alignment algorithm for context-sensitive hidden Markov models [PDF]
, 2005 The hidden Markov model is well-known for its efficiency in modeling short-term dependencies between adjacent samples. However, it cannot be used for modeling longer-range interactions between symbols that are distant from each other.
Vaidyanathan, P. P., Yoon, Byung-Jun
core +1 more source
Un algorithme d'analyse de type earley pour grammaires à concaténation d'intervalles [PDF]
, 2009 Nous présentons ici différents algorithmes d’analyse pour grammaires à concaténation d’intervalles (Range Concatenation Grammar, RCG), dont un nouvel algorithme de type Earley, dans le paradigme de l’analyse déductive.
Kallmeyer, Laura +2 more
core +2 more sources
Parsing for ET0L Systems [PDF]
, 2020 Táto bakalárska práca sa zaoberá zisťovaním príslušnosti reťazcov do jazykov generovaných ET0L systémami. To je dosiahnuté navrhnutím dvoch algoritmov.
Kožár, Tomáš
core
RNA secondary structure prediction from multi-aligned sequences [PDF]
, 2013 It has been well accepted that the RNA secondary structures of most functional non-coding RNAs (ncRNAs) are closely related to their functions and are conserved during evolution.
A Balik +71 more
core +1 more source
Watson–Crick context-free grammars: Grammar simplifications and a parsing algorithm [PDF]
, 2018 A Watson–Crick (WK) context-free grammar, a context-free grammar with productions whose right-hand sides contain nonterminals and double-stranded terminal strings, generates complete double-stranded strings under Watson–Crick complementarity.
Messikh Azeddine, Azeddine +3 more
core +1 more source
Combining translation memories and syntax-based SMT: experiments with real industrial data [PDF]
, 2016 One major drawback of using Translation Memories (TMs) in phrase-based Machine Translation (MT) is that only continuous phrases are considered. In contrast, syntax-based MT allows phrasal discontinuity by learning translation rules containing non ...
Li, Liangyou +2 more
core
Computational identification and analysis of noncoding RNAs - Unearthing the buried treasures in the genome [PDF]
, 2007 The central dogma of molecular biology states that the genetic information flows from DNA to RNA to protein. This dogma has exerted a substantial influence on our understanding of the genetic activities in the cells.
Vaidyanathan, P. P., Yoon, Byung-Jun
core
Image-based window detection: an overview [PDF]
, 2016 Automated segmentation of buildings’ façade and detection of its elements is of high relevance in various fields of research as it, e. g., reduces the effort of 3 D reconstructing existing buildings and even entire cities or may be used for navigation ...
Koch, Christian +2 more
core