Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ACL
1998

favoriteEmaildiscussreport

105views Computational Linguistics» more ACL 1998»

An Alternative LR Algorithm for TAGs

13 years 5 months ago

An Alternative LR Algorithm for TAGs

Download www.aclweb.org

We present a new LR algorithm for treeadjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpler, being very close to traditional LR parsing for context-free grammars. The construction of derived trees and the computation of features also become straightforward.

Mark-Jan Nederhof

Real-time Traffic

ACL 1998 | ACL 2007 | Context-free Grammars | LR Parsing |

claim paper

Related Content

» Deterministic Left to Right Parsing of Tree Adjoining Languages

» Toward an Alternative Comparison between Different Genetic Programming Systems

» Resolution Enhancement of PMD Range Maps

» Creating tag hierarchies for effective navigation in social media

» CETR content extraction via tag ratios

» ECC Processor with Low Die Size for RFID Applications

» How Much Zoom is the Right Zoom from the Perspective of SuperResolution

» Unsupervised multifeature tag relevance learning for social image retrieval

» Communitybased ranking of the social web

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1998
Where	ACL
Authors	Mark-Jan Nederhof

Comments (0)