Sciweavers

66 search results - page 3 / 14
» An Optimal Tabular Parsing Algorithm
Sort
View
ANLP
2000
126views more  ANLP 2000»
13 years 7 months ago
Compound Noun Segmentation Based on Lexical Data Extracted from Corpus
Compound noun analysis is one of the crucial problems in Korean language processing because a series of nouns in Korean may appear without white space in real texts, which makes i...
Juntae Yoon
ACL
1996
13 years 7 months ago
Parsing Algorithms and Metrics
Many different metrics exist for evaluating parsing results, including Viterbi, Crossing Brackets Rate, Zero Crossing Brackets Rate, and several others. However, most parsing algo...
Joshua Goodman
ACL
2010
13 years 4 months ago
Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
Benoît Sagot, Giorgio Satta
EMNLP
2007
13 years 8 months ago
Single Malt or Blended? A Study in Multilingual Parser Optimization
We describe a two-stage optimization of the MaltParser system for the ten languages in the multilingual track of the CoNLL 2007 shared task on dependency parsing. The first stage...
Johan Hall, Jens Nilsson, Joakim Nivre, Gülse...
EMNLP
2011
12 years 6 months ago
Training dependency parsers by jointly optimizing multiple objectives
We present an online learning algorithm for training parsers which allows for the inclusion of multiple objective functions. The primary example is the extension of a standard sup...
Keith Hall, Ryan T. McDonald, Jason Katz-Brown, Mi...