Publishing Partner: Cambridge University Press CUP Extra Publisher Login
amazon logo
More Info


New from Oxford University Press!

ad

Vowel Length From Latin to Romance

By Michele Loporcaro

This book "draws on extensive empirical data, including from lesser known varieties" and "puts forward a new account of a well-known diachronic phenomenon."


New from Cambridge University Press!

ad

Letter Writing and Language Change

Edited By Anita Auer, Daniel Schreier, and Richard J. Watts

This book "challenges the assumption that there is only one 'legitimate' and homogenous form of English or of any other language" and "supports the view of different/alternative histories of the English language and will appeal to readers who are skeptical of 'standard' language ideology."


Academic Paper


Title: Structure-guided supertagger learning
Author: Yao-Zhong Zhang
Institution: University of Tokyo
Author: Takuya Matsuzaki
Institution: University of Tokyo
Author: Jun-ichi Tsujii
Institution: Microsoft Research Asia
Linguistic Field: Computational Linguistics
Abstract: As described in this paper, we specifically examine the structural learning problem of a supertagging task. Supertagging is a task to assign the most probable lexical entry to each word in a sentence. A supertagger is extremely important for a lexicalized grammar parser because an accurate supertagger can greatly reduce lexical ambiguity in downstream parser. Supertagging is more challenging than conventional sequence labeling tasks (e.g., part-of-speech tagging). First, the supertags are numerous. Supertags are the lexical entries defined in a lexicalized grammar, which consists of rich syntactic/semantic information. Second, the inter-supertag relation is more complex. A proper supertag assignment is expected to be compatible with other supertag assignments in a sentence to construct a parse tree. Commonly used adjacent label features (e.g., first-order edge feature) in a sequence labeling model are too rough for the supertagging task. Long-range information is extremely important for the supertagging task. Two approaches to consider long-range information in a supertagger's training stage are proposed. Specifically, we propose a dependency-informed supertagger to use word-to-word dependency derived from a dependency parser and generate long-range features as soft constraints in the training. In the forest-guided supertagger, we constrain the classifier to learn in a grammar-satisfying space and use a CFG filter to impose grammar constraints for the update of model parameters. The experiments show that the proposed structure-guided supertaggers perform significantly better than the baseline supertaggers. Based on the improved supertaggers, the F-score of the final parser is also improved. Using the forest-guided supertagger in a shift-reduce HPSG parser, we achieved a competitive parsing performance of 89.31% F-score with higher parsing speed than that of a state-of-the-art HPSG parser.

CUP AT LINGUIST

This article appears IN Natural Language Engineering Vol. 18, Issue 2, which you can READ on Cambridge's site .



Add a new paper
Return to Academic Papers main page
Return to Directory of Linguists main page