A Formal Model of Ambiguity and its Applications in Machine Translation
| dc.contributor.advisor | Resnik, Philip | en_US |
| dc.contributor.author | Dyer, Christopher | en_US |
| dc.contributor.department | Linguistics | en_US |
| dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
| dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
| dc.date.accessioned | 2011-02-19T07:05:47Z | |
| dc.date.available | 2011-02-19T07:05:47Z | |
| dc.date.issued | 2010 | en_US |
| dc.description.abstract | Systems that process natural language must cope with and resolve ambiguity. In this dissertation, a model of language processing is advocated in which multiple inputs and multiple analyses of inputs are considered concurrently and a single analysis is only a last resort. Compared to conventional models, this approach can be understood as replacing single-element inputs and outputs with weighted sets of inputs and outputs. Although processing components must deal with sets (rather than individual elements), constraints are imposed on the elements of these sets, and the representations from existing models may be reused. However, to deal efficiently with large (or infinite) sets, compact representations of sets that share structure between elements, such as weighted finite-state transducers and synchronous context-free grammars, are necessary. These representations and algorithms for manipulating them are discussed in depth in depth. To establish the effectiveness and tractability of the proposed processing model, it is applied to several problems in machine translation. Starting with spoken language translation, it is shown that translating a set of transcription hypotheses yields better translations compared to a baseline in which a single (1-best) transcription hypothesis is selected and then translated, independent of the translation model formalism used. More subtle forms of ambiguity that arise even in text-only translation (such as decisions conventionally made during system development about how to preprocess text) are then discussed, and it is shown that the ambiguity-preserving paradigm can be employed in these cases as well, again leading to improved translation quality. A model for supervised learning that learns from training data where sets (rather than single elements) of correct labels are provided for each training instance and use it to learn a model of compound word segmentation is also introduced, which is used as a preprocessing step in machine translation. | en_US |
| dc.identifier.uri | http://hdl.handle.net/1903/11217 | |
| dc.subject.pqcontrolled | Language, Linguistics | en_US |
| dc.subject.pqcontrolled | Computer Science | en_US |
| dc.title | A Formal Model of Ambiguity and its Applications in Machine Translation | en_US |
| dc.type | Dissertation | en_US |
Files
Original bundle
1 - 1 of 1