DE eng

Search in the Catalogues and Directories

Page: 1 2
Hits 1 – 20 of 21

1
Translation-based Supervision for Policy Generation in Simultaneous Neural Machine Translation ...
BASE
Show details
2
Better Neural Machine Translation by Extracting Linguistic Information from BERT ...
BASE
Show details
3
Pointer-based Fusion of Bilingual Lexicons into Neural Machine Translation ...
BASE
Show details
4
Top-down Tree Structured Decoding with Syntactic Connections for Neural Machine Translation and Parsing ...
BASE
Show details
5
An Easily Extensible HMM Word Aligner
In: Prague Bulletin of Mathematical Linguistics , Vol 111, Iss 1, Pp 87-96 (2018) (2018)
BASE
Show details
6
A Python-based Interface for Wide Coverage Lexicalized Tree-adjoining Grammars
In: Prague Bulletin of Mathematical Linguistics , Vol 103, Iss 1, Pp 139-159 (2015) (2015)
BASE
Show details
7
Kriya - an end-to-end hierarchical phrase-based MT system
In: The Prague bulletin of mathematical linguistics. - Praha : Univ. (2012) 97, 83-98
BLLDB
OLC Linguistik
Show details
8
Analysis of Semi-Supervised Learning with the Yarowsky Algorithm ...
Abstract: The Yarowsky algorithm is a rule-based semi-supervised learning algorithm that has been successfully applied to some problems in computational linguistics. The algorithm was not mathematically well understood until (Abney 2004) which analyzed some specific variants of the algorithm, and also proposed some new algorithms for bootstrapping. In this paper, we extend Abney's work and show that some of his proposed algorithms actually optimize (an upper-bound on) an objective function based on a new definition of cross-entropy which is based on a particular instantiation of the Bregman distance between probability distributions. Moreover, we suggest some new algorithms for rule-based semi-supervised learning and show connections with harmonic functions and minimum multi-way cuts in graph-based semi-supervised learning. ... : Appears in Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence (UAI2007) ...
Keyword: FOS Computer and information sciences; Machine Learning cs.LG; Machine Learning stat.ML
URL: https://dx.doi.org/10.48550/arxiv.1206.5240
https://arxiv.org/abs/1206.5240
BASE
Hide details
9
Semi-supervised model adaptation for statistical machine translation
In: Machine translation. - Dordrecht [u.a.] : Springer Science + Business Media 21 (2007) 2, 77-94
BLLDB
OLC Linguistik
Show details
10
A clustering approach for the nearly unsupervised recognition of nonliteral language
In: Association for Computational Linguistics / European Chapter. Conference of the European Chapter of the Association for Computational Linguistics. - Menlo Park, Calif. : ACL 11 (2006), 329-336
BLLDB
Show details
11
D-LTAG System: Discourse Parsing with a Lexicalized Tree-Adjoining Grammar
In: Journal of logic, language and information. - Dordrecht [u.a.] : Kluwer 12 (2003) 3, 261-280
OLC Linguistik
Show details
12
Discourse and information structure
In: Journal of logic, language and information. - Dordrecht [u.a.] : Kluwer 12 (2003) 3, 249-374
BLLDB
Show details
13
Tree adjoining grammars and their application to statistical parsing
In: Data-oriented parsing. - Stanford, Calif. : CSLI Publ. (2003), 253-281
BLLDB
Show details
14
A Note on Typing Feature Structures
In: Computational linguistics. - Cambridge, Mass. : MIT Press 28 (2002) 3, 389
OLC Linguistik
Show details
15
A note on typing feature structures
In: Computational linguistics. - Cambridge, Mass. : MIT Press 28 (2002) 3, 389-397
BLLDB
Show details
16
Combining labeled and unlabeled data in statistical natural language parsing
In: Dissertations available from ProQuest (2002)
BASE
Show details
17
Tree adjoining grammars : formalisms, linguistic analysis and processing
Issac, Fabrice (Mitarb.); Sarkar, Anoop (Mitarb.); Joshi, Aravind K. (Mitarb.). - Stanford, Calif. : CSLI Publ., 2000
BLLDB
UB Frankfurt Linguistik
Show details
18
The conflict between future tense and modality : the case of "will" in English
In: University of Pennsylvania. University of Pennsylvania working papers in linguistics. - Philadelphia, Pa. : Univ. 5 (1998) 2, 91-117
BLLDB
Show details
19
Separating Dependency from Constituency in a Tree Rewriting System ...
Sarkar, Anoop. - : arXiv, 1998
BASE
Show details
20
The Conflict Between Future Tense and Modality: The Case of Will in English
In: University of Pennsylvania Working Papers in Linguistics (1998)
BASE
Show details

Page: 1 2

Catalogues
1
0
4
0
0
0
0
Bibliographies
8
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
11
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern