4199 search results - page 122 / 840 » Generalizing Data in Natural Language |
119
click to vote
EMNLP
2010
15 years 3 months ago
2010
Part-of-speech (POS) induction is one of the most popular tasks in research on unsupervised NLP. Many different methods have been proposed, yet comparisons are difficult to make s...
146
click to vote
EMNLP
2009
15 years 2 months ago
2009
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...
181
click to vote
EMNLP
2011
14 years 4 months ago
2011
Previous work has shown that high quality phrasal paraphrases can be extracted from bilingual parallel corpora. However, it is not clear whether bitexts are an appropriate resourc...
147
click to vote
ACL
1998
15 years 6 months ago
1998
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
172
click to vote
ASPLOS
2008
ACM
15 years 7 months ago
2008
ACM
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...