Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
On Parsing and Condensing Substrings of LR Languages in Line...
Sort
relevance
views
votes
recent
update
View
thumb
title
20
click to vote
WIA
1998
Springer
110
views
Artificial Intelligence
»
more
WIA 1998
»
On Parsing and Condensing Substrings of LR Languages in Linear Time
14 years 2 days ago
Download
www-mmdb.iai.uni-bonn.de
Abstract. LR parsers have long been known as being an efficient algorithm for recognizing deterministic context
Heiko Goeman
claim paper
Read More »
28
click to vote
LACL
2005
Springer
102
views
Automated Reasoning
»
more
LACL 2005
»
Strict Deterministic Aspects of Minimalist Grammars
14 years 1 months ago
Download
www.linguistics.ucla.edu
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
John T. Hale, Edward P. Stabler
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »