Search Sciweavers | Sciweavers

84 search results - page 9 / 17

» Evolutionary Parsing for a Probabilistic Context Free Gramma...

click to vote

NAACL
2010

155views Computational Linguistics» more NAACL 2010»

Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems

13 years 5 months ago

Download www.grupolys.org

The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...

Carlos Gómez-Rodríguez, Marco Kuhlma...

claim paper

Read More »

click to vote

AAAI
1996

103views Intelligent Agents» more AAAI 1996»

Generalized Queries on Probabilistic Context-Free Grammars

13 years 9 months ago

Download people.ict.usc.edu

David V. Pynadath, Michael P. Wellman

claim paper

Read More »

click to vote

COLING
1999

110views Computational Linguistics» more COLING 1999»

Statistical Properties of Probabilistic Context-Free Grammars

13 years 7 months ago

Download acl.ldc.upenn.edu

Zhiyi Chi

claim paper

Read More »

click to vote

COLING
2007

100views Computational Linguistics» more COLING 2007»

Weighted and Probabilistic Context-Free Grammars Are Equally Expressive

13 years 7 months ago

Download www.cs.cmu.edu

Noah A. Smith, Mark Johnson

claim paper

Read More »

click to vote

ACL
2004

139views Computational Linguistics» more ACL 2004»

Generalized Multitext Grammars

13 years 9 months ago

Download www.cs.nyu.edu

Generalized Multitext Grammar (GMTG) is a synchronous grammar formalism that is weakly equivalent to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notatio...

I. Dan Melamed, Giorgio Satta, Benjamin Wellington

claim paper

Read More »

« Prev « First page 9 / 17 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers