Báo cáo khoa học: "COMPACT REPRESENTATIONS BY FINITE-STATE TRANSDUCERS" pot
... COMPACT REPRESENTATIONS BY FINITE-STATE TRANSDUCERS Mehryar Mohri Institut Gaspard Monge-LADL Universit6 Marne-la-Vall6e ... transducers can be transformed into sequential transducers by adding p new letters to the alpha- bet A, and by replacing the p final functions by transitions labeled with these new letters on in- ... these representations can be made very compact,...
Ngày tải lên: 23/03/2014, 20:21
... a complex between apoTf and Np(IV) with the NTA synergistic anion (a) the titration of Np(IV) with 2.8 equivalents of NTA by apoTf (Fig. 2A) and (b) the titration of apoTf by Np(IV) with 2.8 ... Titration of Np(IV) in the presence of 2.8 equivalents of NTA per Np by apoTf from [Tf] ⁄ [Np] ¼ 0–1.27. (B) Titration of apoTf by Np(IV) in the presence of 2.8 equivalents of NTA per Np from...
Ngày tải lên: 07/03/2014, 17:20
... tion can potentially gather and draw in relevant background information, in the form of descrip- tions of discourse entities from different parts of the source. We therefore hypothesize that ... by more than 5. The syntactic structure of each source sen- tence is extracted using Apple Pie 7.2 (Sekine 1998), a statistical parser trained on Penn Tree- bank data. It was evaluated by...
Ngày tải lên: 17/03/2014, 07:20
Tài liệu Báo cáo khoa học: Calcium signalling by nicotinic acid adenine dinucleotide phosphate (NAADP) doc
... receptors [14,21,24]. Furthermore, NAADP-mediated Ca 2+ release is neither potentiated by Ca 2+ or Sr 2+ , nor inhibited by Mg 2+ [14,21,29]. Therefore in contrast to Fig. 1. Inactivation properties ... rarely operates in isolation. Rather the resultant Ca 2+ signals evoked by this molecule are often boos- ted by Ca 2+ release by RyRs, InsP 3 Rs or both. Inter- actions between diffe...
Ngày tải lên: 20/02/2014, 01:20
Tài liệu Báo cáo khoa học: "Faster Parsing by Supertagger Adaptation" pptx
... mul- tiple passes over a sentence. If a spanning analy- sis cannot be found by the parser, the number of lexical categories supplied by the supertagger is increased. The supertagger-parser interaction ... However, it does so with much lower ambiguity levels, and potentially during an ear- lier pass, which means sentences are parsed faster. By increasing the ambiguity level of the adapti...
Ngày tải lên: 20/02/2014, 04:20
Tài liệu Báo cáo khoa học: "Word representations: A simple and general method for semi-supervised learning" doc
... these tasks using clustering representations (Section 3) and distributed representations (Section 4), so we focus on these representations in our work. 3 Clustering-based word representations Another ... their choice of feature set: • CRF++ by Taku Kudo (http://crfpp. sourceforge.net/) • crfsgd by L ´ eon Bottou (http://leon. bottou.org/projects/sgd) • CRFsuite by by Naoaki Okaz...
Ngày tải lên: 20/02/2014, 04:20
Tài liệu Báo cáo khoa học: "Finding Hedges by Chasing Weasels: Hedge Detection Using Wikipedia Tags and Shallow Linguistic Features" doc
... classified by S → weasel if wpw(S) > σ (4) where σ is an arbitrary threshold used to control the precision/recall balance and wpw(S) is the sum of scores over all words in S, normalized by the ... subjectivity (see Pang & Lee (2008) for an overview). However, even opin- ions have to be backed up by facts to be effective as arguments. Distinguishing facts from fiction re- quires to...
Ngày tải lên: 20/02/2014, 09:20
Tài liệu Báo cáo khoa học: "Acceptability Prediction by Means of Grammaticality Quantification" doc
... grammatical. In this conception, a language (be it natural or not) is produced (or generated) by a grammar by means of a specific mechanism, for example derivation. However, when no structure can be ... etc.). All these objects are described by means of a set of properties (see (Blache05b)). In terms of parsing, the mechanism consists in exhibiting the potential constituents of a given c...
Ngày tải lên: 20/02/2014, 11:21
Tài liệu Báo cáo khoa học: "Tagging English by Path Voting Constraints" pptx
... directed acyclic graph 2 Tagging by Path Voting Constraints We assume that sentences are delineated and that each token is assigned all possible tags by a lexicon or by a morphological analyzer. ... wj, i _< j < i + n - 1 is subsumed by the corre- sponding constraint Cj-i+l. When such a match occurs, the vote of the path is incremented by V. When all constraints are a...
Ngày tải lên: 20/02/2014, 18:20
Tài liệu Báo cáo khoa học: "Sentence Disambiguation by a Shift-Reduce Parsing Technique" pot
... AI. Starting from the hypothesis that ~deterministic" parsing of English is possible, he demonstrated that certain performance "This research was supported by the Defense Advanced ... to resolve these conflicts: 5 (I) Resolve shift-reduce conflicts by shifting. (2) Resolve reduce-reduce conflicts by performing the longer reduction. These two rules suffice to engender...
Ngày tải lên: 21/02/2014, 20:20