210
click to vote
ACL
2012
13 years 9 months ago
2012
Reordering is a difficult task in translating between widely different languages such as Japanese and English. We employ the postordering framework proposed by (Sudoh et al., 201...
179
click to vote
ACL
2012
13 years 9 months ago
2012
We present a simple and effective framework for exploiting multiple monolingual treebanks with different annotation guidelines for parsing. Several types of transformation pattern...
189
Voted
ACL
2012
13 years 9 months ago
2012
We describe a discourse annotation scheme for Chinese and report on the preliminary results. Our scheme, inspired by the Penn Discourse TreeBank (PDTB), adopts the lexically groun...
176
click to vote
ACL
2012
13 years 9 months ago
2012
This paper presents a two-step approach to compress spontaneous spoken utterances. In the first step, we use a sequence labeling method to determine if a word in the utterance ca...
187
click to vote
ACL
2012
13 years 9 months ago
2012
Prepositions and conjunctions are two of the largest remaining bottlenecks in parsing. Across various existing parsers, these two categories have the lowest accuracies, and mistak...
201
click to vote
ACL
2012
13 years 9 months ago
2012
This paper describes the personalized normalization of a multilingual chat system that supports chatting in user defined short-forms or abbreviations. One of the major challenges ...
173
Voted
ACL
2012
13 years 9 months ago
2012
We propose a novel model to automatically extract transliteration pairs from parallel corpora. Our model is efficient, language pair independent and mines transliteration pairs i...
183
click to vote
ACL
2012
13 years 9 months ago
2012
For sentence compression, we propose new semantic constraints to directly capture the relations between a predicate and its arguments, whereas the existing approaches have focused...
193
click to vote
ACL
2012
13 years 9 months ago
2012
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
242
click to vote
ACL
2012
13 years 9 months ago
2012
Unsupervised word representations are very useful in NLP tasks both as inputs to learning algorithms and as extra word features in NLP systems. However, most of these models are b...