1455 search results - page 131 / 291 » Programming in Logic with Constraints for Natural Language P... |
ACL
1990
13 years 10 months ago
1990
We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation...
LACL
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES) and model-theoretic...
ECOOP
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
ACL
1998
13 years 10 months ago
1998
We describe an on-going project whose primary aim is to establish the technology of producing closed captions for TV news programs efficiently using natural language processing an...