Sciweavers

NAACL
2010
13 years 9 months ago
Softmax-Margin CRFs: Training Log-Linear Models with Cost Functions
We describe a method of incorporating taskspecific cost functions into standard conditional log-likelihood (CLL) training of linear structured prediction models. Recently introduc...
Kevin Gimpel, Noah A. Smith
NAACL
2010
13 years 9 months ago
Enlarged Search Space for SITG Parsing
Guillem Gascó i Mora, Joan-Andreu Sá...
NAACL
2010
13 years 9 months ago
Using Confusion Networks for Speech Summarization
For extractive meeting summarization, previous studies have shown performance degradation when using speech recognition transcripts because of the relatively high speech recogniti...
Shasha Xie, Yang Liu
NAACL
2010
13 years 9 months ago
Urdu Word Segmentation
Word Segmentation is the foremost obligatory task in almost all the NLP applications where the initial phase requires tokenization of input into words. Urdu is amongst the Asian l...
Nadir Durrani, Sarmad Hussain
NAACL
2010
13 years 9 months ago
Investigations into the Crandem Approach to Word Recognition
We suggest improvements to a previously proposed framework for integrating Conditional Random Fields and Hidden Markov Models, dubbed a Crandem system (2009). The previous authors...
Rohit Prabhavalkar, Preethi Jyothi, William Hartma...
NAACL
2010
13 years 9 months ago
Cheap, Fast and Good Enough: Automatic Speech Recognition with Non-Expert Transcription
Deploying an automatic speech recognition system with reasonable performance requires expensive and time-consuming in-domain transcription. Previous work demonstrated that non-pro...
Scott Novotney, Chris Callison-Burch
NAACL
2010
13 years 9 months ago
Automatic Metaphor Interpretation as a Paraphrasing Task
We present a novel approach to metaphor interpretation and a system that produces literal paraphrases for metaphorical expressions. Such a representation is directly transferable ...
Ekaterina Shutova
NAACL
2010
13 years 9 months ago
Automatic Domain Adaptation for Parsing
Current statistical parsers tend to perform well only on their training domain and nearby genres. While strong performance on a few related domains is sufficient for many situatio...
David McClosky, Eugene Charniak, Mark Johnson
NAACL
2010
13 years 9 months ago
Multi-document Summarization via Budgeted Maximization of Submodular Functions
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
Hui Lin, Jeff Bilmes
NAACL
2010
13 years 9 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea