Sciweavers

13 search results - page 3 / 3
» Recognition of Linear Context-Free Rewriting Systems
Sort
View
ICDT
2010
ACM
147views Database» more  ICDT 2010»
13 years 8 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
LACL
1998
Springer
13 years 9 months ago
Strict Compositionality and Literal Movement Grammars
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
Marcus Kracht
DLT
2006
13 years 6 months ago
Noncanonical LALR(1) Parsing
This paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing the usage of noncanonical parsers. To this end, we...
Sylvain Schmitz