D14-1012 However , fundamental problems on effectively incorporating the word embedding features within the framework of linear models remain .
C86-1088 Thus , the embedding provides a truth-conditional background for the DRS formalism .
C86-1088 The analysis is completed by embedding the DRS representing the text information into a conventional first-order model structure .
C80-1074 Moreover , the embedding operator is sometimes applied to Su in the following way .
C80-1029 The way in which this embedding occurs is related to the level of user of the text .
D08-1086 By simulations , the effectiveness of the analyzer is investigated , and then a LVCSR system embedding the presented analyzer is evaluated .
C86-1088 A text is true if a proper embedding for its DRS exists .
C90-3012 We will attempt to show how human performance limitations on various types of syntactic embedding constructions in Germanic languages can be modelled in a relational network linguistic framework .
C80-1074 * operator applied to the predicate J of the predicate function I Extract the variables J Is the embedding operator applied te the predicate
C88-1033 The problem of classification can be reformulated as the problem of finding an embedding function f from the representational entities onto the domain of a model .
C86-1088 The embedding rule for = > - conditions requires , roughly speaking , that every proper embedding for the antecedent sub-DRS can be properly extended to the consequent sub-DRS .
C86-1088 The embedding rule for = > - conditions requires , roughly speaking , that every proper embedding for the antecedent sub-DRS can be properly extended to the consequent sub-DRS .
C80-1074 When the embedding operator applies to the predicate , the variety of the nominalization operator and the embedded phrase are
C86-1088 A proper embedding is a function from 1J / ~ to the model universe , assigning real-world objects to DRs in a way that all conditions of the DRS are satisfied .
C80-1009 As he points out , this is a simple and natural way of treating any construction capable of unlimited embedding .
D10-1116 This method ensures that each word encodes a unique sequence of bits , without cutting out large number of synonyms , and thus maintaining a reasonable embedding capacity .
C00-1055 We have experimented with lnore elaborate functions that indicate how balanced the parse tree is and less complicated functions such as the level of embedding , number of parentheses , and so oil .
C86-1008 The importance of such a structural description , if attained , is that it would make possible an axiomatic theory of dialogue , embedding rhetorical patterns , focusing , and focus shifting .
C80-1074 The clause or noun phrase which is produced by the application of the nominalization operator , is substituted in the variable of other predicate function by embedding operator fIII .
C96-1045 F-structures are either interpreted indirectly in terms of a homomorphic embedding into Quasi Logical Form ( QLF ) ( Alshawi , 1992 ; Alshawi & Crouch , 1992 ; Cooper et al. , 1994a ) representations or directly in terms of adapting QLF interpretation clauses to f-structure representations .
hide detail