Sciweavers

33 search results - page 2 / 7
» A Probabilistic Context-free Grammar for Disambiguation in M...
Sort
View
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
13 years 10 months ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo
TSD
2007
Springer
14 years 15 days ago
Accurate Unlexicalized Parsing for Modern Hebrew
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
Reut Tsarfaty, Khalil Sima'an
COLING
2010
13 years 1 months ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
JOLLI
2006
101views more  JOLLI 2006»
13 years 6 months ago
A Note on the Expressive Power of Probabilistic Context Free Grammars
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...
Gabriel G. Infante López, Maarten de Rijke
COLING
2000
13 years 7 months ago
Robust German Noun Chunking With a Probabilistic Context-Free Grammar
We present a noun chunker for German which is based on a head-lexicalised probabilistic contextfl'ee grammar. A manually developed grammar was semi-automatically extended wit...
Helmut Schmid, Sabine Schulte im Walde