Results 1  10
of
309
Semirings and TreetoGraphtoTree Transductions
, 1995
"... It is shown that topdown tree transducers are as powerful as sharingfree treetograph totree transducers as far as the computation of functions is considered whose codomain is a semiring. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
It is shown that topdown tree transducers are as powerful as sharingfree treetograph totree transducers as far as the computation of functions is considered whose codomain is a semiring.
Semiring Parsing
 Computational Linguistics
, 1999
"... this paper is that all five of these commonly computed quantities can be described as elements of complete semirings (Kuich 1997). The relationship between grammars and semirings was discovered by Chomsky and Schtitzenberger (1963), and for parsing with the CKY algorithm, dates back to Teitelbaum ( ..."
Abstract

Cited by 86 (1 self)
 Add to MetaCart
this paper is that all five of these commonly computed quantities can be described as elements of complete semirings (Kuich 1997). The relationship between grammars and semirings was discovered by Chomsky and Schtitzenberger (1963), and for parsing with the CKY algorithm, dates back to Teitelbaum
Reestimation of Reified Rules in Semiring Parsing and Biparsing
"... We show that reifying the rules from hyperedge weights to firstclass graph nodes automatically gives us rule expectations in any kind of grammar expressible as a deductive system, without any explicit algorithm for calculating rule expectations (such as the insideoutside algorithm). This gives us e ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We show that reifying the rules from hyperedge weights to firstclass graph nodes automatically gives us rule expectations in any kind of grammar expressible as a deductive system, without any explicit algorithm for calculating rule expectations (such as the insideoutside algorithm). This gives us
Monadic second–order evaluations on treedecomposable graphs
 Theoret. Comput. Sci
, 1993
"... Courcelle, B. and M. Mosbah, Monadic secondorder evaluations on treedecomposable graphs, ..."
Abstract

Cited by 90 (25 self)
 Add to MetaCart
Courcelle, B. and M. Mosbah, Monadic secondorder evaluations on treedecomposable graphs,
Applications of Lexicographic Semirings to Problems in Speech and Language Processing†
"... This paper explores lexicographic semirings and their application to problems in speech and language processing. Specifically, we present two instantiations of binary lexicographic semirings, one involving a pair of tropical weights, and the other a tropical weight paired with a novel string semiri ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper explores lexicographic semirings and their application to problems in speech and language processing. Specifically, we present two instantiations of binary lexicographic semirings, one involving a pair of tropical weights, and the other a tropical weight paired with a novel string
Natural language processing (almost) from scratch
, 2011
"... We propose a unified neural network architecture and learning algorithm that can be applied to various natural language processing tasks including partofspeech tagging, chunking, named entity recognition, and semantic role labeling. This versatility is achieved by trying to avoid taskspecific eng ..."
Abstract

Cited by 209 (17 self)
 Add to MetaCart
We propose a unified neural network architecture and learning algorithm that can be applied to various natural language processing tasks including partofspeech tagging, chunking, named entity recognition, and semantic role labeling. This versatility is achieved by trying to avoid taskspecific engineering and therefore disregarding a lot of prior knowledge. Instead of exploiting manmade input features carefully optimized for each task, our system learns internal representations on the basis of vast amounts of mostly unlabeled training data. This work is then used as a basis for building a freely available tagging system with good performance and minimal computational requirements.
Definable transductions and weighted logics for texts
 In DLT 2007, LNCS
, 2007
"... Abstract. A text is a word together with an additional linear order on it. We study quantitative models for texts, i. e. text series which assign to texts elements of a semiring. We consider an algebraic notion of recognizability following Reutenauer and Bozapalidis and show that recognizable text ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. A text is a word together with an additional linear order on it. We study quantitative models for texts, i. e. text series which assign to texts elements of a semiring. We consider an algebraic notion of recognizability following Reutenauer and Bozapalidis and show that rec
Decidability of the Finiteness of Ranges of Tree Transductions
 Inform. and Comput
, 1996
"... . The finiteness of ranges of tree transductions is shown to be decidable for TBY + , the composition closure of macro tree transductions. Furthermore, TBY + definable sets and TBY + computable relations are considered, which are obtained by viewing a tree as an expression that denotes an elem ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
. The finiteness of ranges of tree transductions is shown to be decidable for TBY + , the composition closure of macro tree transductions. Furthermore, TBY + definable sets and TBY + computable relations are considered, which are obtained by viewing a tree as an expression that denotes
PhD Depth Examination Report Algebraic Foundation of Statistical Parsing Semiring Parsing
, 2004
"... Statistical parsing algorithms are useful in structure prediction applications, ranging from natural language processing to biological sequence analysis. Currently, there are a variety of efficient parsing algorithms available for different grammar formalisms. Conventionally, different parsing algor ..."
Abstract
 Add to MetaCart
algorithms are needed for different tasks; a fair amount of work is required to construct for each one. Semiring parsing is proposed to provide a generalized and modularized framework to unify all these different parsing algorithms into a general framework and by separation of the underlying algebraic
Relational morphisms, transductions and
"... 1 Preliminaries. The notions of recognizable and rational subsets are not limited to free semigroups. The rational subsets of a semigroup (monoid) S form the smallest classRat ( S) of subsets of S such that (a) the empty set and every singleton {s} belong to Rat(S), (b) if X and Y are in Rat(S), th ..."
Abstract
 Add to MetaCart
1 Preliminaries. The notions of recognizable and rational subsets are not limited to free semigroups. The rational subsets of a semigroup (monoid) S form the smallest classRat ( S) of subsets of S such that (a) the empty set and every singleton {s} belong to Rat(S), (b) if X and Y are in Rat(S), then so are XY and X [ Y, (c) if X is in Rat(S), then so is X+ (respectively X*), the subsemigroup(submonoid) of S generated by X. *This work was supported by "Programme de Recherches Coordonn'ees Math'ematique et Informatique". 1 A subset P of S is said to be recognizable if there exists a finite semigroup F, asemigroup morphism ' : S! F and a subset Q of F such that P = Q'1. Weshall denote by Rec ( S) the class of recognizable subsets of S. It is well knownthat, if A is a finite alphabet, then Rec(
Results 1  10
of
309