Spelling suggestions: "subject:"achine translating."" "subject:"cachine translating.""
1 |
Extreme learning machine for multi-class classificationWong, Chi Man January 2018 (has links)
University of Macau / Faculty of Science and Technology. / Department of Computer and Information Science
|
2 |
Stone soup translation the linked automata model /Davis, Paul C. January 2002 (has links)
Thesis (Ph. D.)--Ohio State University, 2002. / Title from first page of PDF file. Document formatted into pages; contains xvi, 306 p.; includes graphics. Includes abstract and vita. Advisor: Chris Brew, Dept. of Linguistics. Includes indexes. Includes bibliographical references (p. 284-293).
|
3 |
The enhancement of machine translation for low-density languages using web-gathered parallel textsMohler, Michael Augustine Gaylord. Mihalcea, Rada F., January 2007 (has links)
Thesis (M.S.)--University of North Texas, Dec., 2007. / Title from title page display. Includes bibliographical references.
|
4 |
Translation hypotheses re-ranking for statistical machine translationLiu, Yan January 2017 (has links)
University of Macau / Faculty of Science and Technology / Department of Computer and Information Science
|
5 |
A comparative study of pre-editing in two machine translation systems :Google & SystranChao, Weng Io, Tiffany January 2018 (has links)
University of Macau / Faculty of Arts and Humanities. / Department of English
|
6 |
Using semantic role labels to reorder statistical machine translation output /Lo, Chi Kiu. January 2009 (has links)
Includes bibliographical references (p. 78-84).
|
7 |
Theory and applications of a bottom-up syntax-directed translatorAbramson, Harvey David January 1970 (has links)
No description available.
|
8 |
Machine recognition of independent and contextually constrained contour-traced handprinted charactersToussaint, Godfried T. January 1969 (has links)
A contour-tracing technique originally divised by Clemens and Mason was modified and used with several different classifiers of varying complexity to recognize upper case handprinted alphabetic characters. An analysis and comparison of the various classifiers, with the modifications introduced to handle variable length feature vectors, is presented.
On independent characters, one easily realized suboptimum parametric classifier yielded recognition accuracies which compare favourably with other published results. Additional simple tests on commonly confused characters improved results significantly as did use of contextual constraints. In addition, the above classifier uses much less storage capacity than a non-parametric optimum Bayes classifier and performs significantly better than the optimum classifier when training and testing data are limited.
The optimum decision on a string of m contextually constrained characters, each having a variable-length feature vector, is derived. A computationally efficient algorithm, based on this equation, was developed and tested with monogram, bigram and trigram contextual constraints of English text. A marked improvement in recognition accuracy was noted over the case when contextual constraints were not used, and a trade-off was observed not only between the order of contextual information used and the number of measurements taken, but also between the order of context and the value of a parameter ds which indicates the complexity of the classification algorithm. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate
|
9 |
Stone soup translation : the linked automata model /Davis, Paul C. January 2002 (has links)
No description available.
|
10 |
Computability and complexity issues of translator generation /Perry, Doyt Lee January 1982 (has links)
No description available.
|
Page generated in 0.0771 seconds