Sciweavers

146 search results - page 23 / 30
» Statistical Parsing with a Context-Free Grammar and Word Sta...
Sort
View
NIPS
2001
13 years 9 months ago
Grammatical Bigrams
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
Mark A. Paskin
LREC
2008
77views Education» more  LREC 2008»
13 years 10 months ago
Word-Based or Morpheme-Based? Annotation Strategies for Modern Hebrew Clitics
Morphologically rich languages pose a challenge to the annotators of treebanks with respect to the status of orthographic (spacedelimited) words in the syntactic parse trees. In s...
Reut Tsarfaty, Yoav Goldberg
PRL
2002
94views more  PRL 2002»
13 years 8 months ago
A hierarchical tag-graph search scheme with layered grammar rules for spontaneous speech understanding
It has always been difficult for language understanding systems to handle spontaneous speech with satisfactory robustness, primarily due to such problems as the fragments, disflue...
Bor-shen Lin, Berlin Chen, Hsin-Min Wang, Lin-Shan...
CSL
2008
Springer
13 years 8 months ago
A stopping criterion for active learning
Active learning (AL) is a framework that attempts to reduce the cost of annotating training material for statistical learning methods. While a lot of papers have been presented on...
Andreas Vlachos
LREC
2010
188views Education» more  LREC 2010»
13 years 10 months ago
Pattern-Based Extraction of Negative Polarity Items from Dependency-Parsed Text
We describe a new method for extracting Negative Polarity Item candidates (NPI candidates) from dependency-parsed German text corpora. Semi-automatic extraction of NPIs is a chall...
Fabienne Fritzinger, Frank Richter, Marion Weller