877 search results - page 46 / 176 » How to Cover a Grammar |
ACL
2011
14 years 4 months ago
2011
Tree-to-string translation is syntax-aware and efficient but sensitive to parsing errors. Forestto-string translation approaches mitigate the risk of propagating parser errors in...
ECAI
2000
Springer
15 years 5 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
80
Voted
ACL
2003
15 years 2 months ago
2003
In this paper, we elucidate how Korean temporal markers, OE and DONGAN contribute to specifying the event time and formalize it in terms of typed lambda calculus. We also present ...
123
Voted
ACL
1990
15 years 1 months ago
1990
In contrast to the "designer logic" approach, this paper shows how the attribute-value feature structures of unification grammar and constraints on them can be axiomatiz...
124
Voted
CC
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...