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
|
|
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
|
|
16 |
Combining labeled and unlabeled data in statistical natural language parsing
|
|
|
|
In: Dissertations available from ProQuest (2002)
|
|
BASE
|
|
Show details
|
|
19 |
Separating Dependency from Constituency in a Tree Rewriting System ...
|
|
|
|
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
|
|
|
|