Sciweavers

877 search results - page 35 / 176
» How to Cover a Grammar
Sort
View
106
Voted
COGSCI
2004
148views more  COGSCI 2004»
15 years 13 days ago
Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
Fernanda Ferreira, Ellen F. Lau, Karl G. D. Bailey
102
Voted
ACL
2009
14 years 10 months ago
Variational Inference for Grammar Induction with Prior Knowledge
Variational EM has become a popular technique in probabilistic NLP with hidden variables. Commonly, for computational tractability, we make strong independence assumptions, such a...
Shay B. Cohen, Noah A. Smith
SAC
2003
ACM
15 years 5 months ago
Can a Parser be Generated from Examples?
One of the open problems in the area of domain-specific languages is how to make domain-specific language development easier for domain experts not versed in a programming languag...
Marjan Mernik, Goran Gerlic, Viljem Zumer, Barrett...
BIRTHDAY
2003
Springer
15 years 5 months ago
Using Alternating Words to Describe Symbolic Pictures
In this paper we present the concepts of drawn symbolic picture and symbolic picture. Such notions have been conceived as an extension of the concept of drawn pictures which was i...
Gennaro Costagliola, Vincenzo Deufemia, Filomena F...
WIA
1997
Springer
15 years 4 months ago
Construction of Efficient Generalized LR Parsers
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
Miguel A. Alonso, David Cabrero, Manuel Vilares Fe...