P11-4019 various domains . First of all , the declarative approach taken by SystemT allows developers
J94-3011 deletion are more awkward for declarative approaches . In English trisyllabic shortening
W01-0809 This is an important reason why a declarative approach would be preferred ( see eg .
E93-1046 above can rather be regarded as a declarative approach to applying the rules than as
W08-1703 1994 ) has argued for developing declarative approaches involving syntactic features
P10-1014 cascading grammar approach and the declarative approach used in SystemT , we now compare
W13-4041 approaches are in line with our declarative approach to modelling , and are thus our
W01-0809 As discussed in section 2 , a declarative approach may be very beneficial for system
D12-1053 principled manner . Furthermore , its declarative approach offers a flexible and interpretable
J13-3005 transformation can not be defined . In a declarative approach such as the one here , dealing
P14-5015 logic programming language . This declarative approach offers a flexible way of experimentation
J14-1002 Joint Inference Here , we take a declarative approach to modeling argument identification
J00-2010 that discuss the application of declarative approaches to tree description to Chomsky
C92-2072 exercise is that the adoption of a declarative approach to the specification of relaxations
P11-4019 . In contrast , SystemT uses a declarative approach based on rules that specify what
P11-4019 decoupling is possible because of the declarative approach in SystemT , where the AQL rules
J92-4004 in a manner consistent with the declarative approach taken in this framework . In
J10-4002 subsequent work it inspired adopted a declarative approach , based on first-order logic
J91-4002 grammar . We prefer to adopt a more declarative approach , in which the grammar is represented
J94-1003 1992 ) . We conclude that the declarative approach to phonology presents an attractive
hide detail