Sciweavers

367 search results - page 8 / 74
» Lexicalized Context-Free Grammars
Sort
View
JALC
2006
90views more  JALC 2006»
13 years 7 months ago
Generating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form
-- Let {a1, a2, . . . , an} be an alphabet of n symbols and let Cn be the language of circular shifts of the word a1a2
Peter R. J. Asveld
ANLP
2000
89views more  ANLP 2000»
13 years 8 months ago
Removing Left Recursion from Context-Free Grammars
A long-standing issue regarding algorithms that manipulate context-free grammars (CFGs) in a "top-down" leftto-right fashion is that left recursion can lead to nontermin...
Robert C. Moore
ANLP
2000
92views more  ANLP 2000»
13 years 8 months ago
Left-To-Right Parsing and Bilexical Context-Free Grammars
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalis an abstraction of language ...
Mark-Jan Nederhof, Giorgio Satta
ACL
1996
13 years 8 months ago
Pattern-Based Context-Free Grammars for Machine Translation
This paper proposes the use of "patternbased" context-free grammars as a basis for building machine translation (MT) systems, which are now being adopted as personal too...
Koichi Takeda
ACL
2010
13 years 5 months ago
Accurate Context-Free Parsing with Combinatory Categorial Grammar
The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. However, the differences between the definitions are important i...
Timothy A. D. Fowler, Gerald Penn