877 search results - page 39 / 176 » How to Cover a Grammar |
80
Voted
ENTCS
2008
15 years 20 days ago
2008
Although programs convey an unambiguous meaning, the grammars used in practice to describe their syntax are often ambiguous, and completed with disambiguation rules. Whether these...
COLING
2008
15 years 2 months ago
2008
Much previous work has investigated weak supervision with HMMs and tag dictionaries for part-of-speech tagging, but there have been no similar investigations for the harder proble...
104
click to vote
ESSLLI
1999
Springer
15 years 4 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
91
Voted
EACL
1993
ACL Anthology
15 years 1 months ago
1993
ACL Anthology
This paper solves some puzzles in the formalisation of logic for discontinuity in categorial grammar. A ‘tuple’ operation introduced in [Solias, 1992] is defined as a mode of...
108
Voted
DBPL
1993
Springer
15 years 4 months ago
1993
Springer
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...