[PDF] Top 20 Feature Logic with Disjunctive Unification
Has 10000 "Feature Logic with Disjunctive Unification" found on our website. Below are the top 20 most common "Feature Logic with Disjunctive Unification".
Feature Logic with Disjunctive Unification
... Feature Logic with Disjunctive Unification F e a t u r e Logic w i t h D i s j u n c t i v e U n i f i c a t i o n dochen Dgrre, Andreas Eisele Institut fiir maschinelle Spraehvera rbcitung Universit~[.] ... See full document
6
Constraint Projection: An Efficient Treatment of Disjunctive Feature Descriptions
... Constraint projection is a generalization of constraint unification, and is more efficient because constraint projection has a mechanism for abandoning information irrelevant to a goal s[r] ... See full document
8
Unification of Disjunctive Feature Descriptions
... • If both unifications have different global results, we can not return a disjunction as local result, since remote parts of the resulting formula depend on the choice of the disjunct at[r] ... See full document
9
A Logical Semantics for Feature Structures
... this grammar contains a large number several hundred of disjunctions, it has been necessary to extend the unification procedure so that it handles disjunctive values containing non-local[r] ... See full document
10
The Formal and Processing Models of CLG
... "Feature Constraint Logics for Unification Grammars", LILOG Report 93, IWBS, IBM Deutschland... Hartmanis eds., Lecture Notes in Computer Science 315, Springer, Berlin..[r] ... See full document
6
Features and Formulae
... "Expressing Disjunctive and Negative Feature Constraints with Classical First-order Logic," in The Proceedings of the 28th Annual Meeting of the Association for Computational Linguistics[r] ... See full document
22
Expressing Disjunctive and Negative Feature Constraints With Classical First Order Logic
... Further, first-order logic can be used to axiomatize other types of feature structures in addition to attribute-value structures such as "set-valued" elements and express a wider variety[r] ... See full document
7
A Unification Method for Disjunctive Feature Descriptions
... In the first step, the definite components of the two descriptions are unified together, producing a DG structure, new-def, which represents the definite information of the result.. This[r] ... See full document
8
Packing of Feature Structures for Efficient Unification of Disjunctive Feature Structures
... Abstract This paper proposes a method for packing feature structures, which automatically collapses equivalent parts of lexical/phrasal feature structures of HPSG into a single packed fe[r] ... See full document
6
A disjunctive conception of acting for reasons
... McDowell’s (§2.2). It can then be seen that the two disjunctive conceptions have work to do together (§2.3), and an underlying structure can be uncovered (§2.4). 2.1 The disjunctive conception of ... See full document
18
Revealing the Ubiquitous Effects of Quantum Entanglement—Toward a Notion of God Logic
... “God Logic” seems to be the best option for revealing the ubiquitous effects of quantum entanglement and programming all the particles of the ...“God Logic” might be inappropriate or inadequate for its ... See full document
11
Integrating “Free” Word Order Syntax and Information Structure
... To improve the effi- ciency of unification and parsing, the arguments of the categories represented as DAGS are associated with feature labels that indicate their category and case... 5A[r] ... See full document
8
Feature Structures and Nonmonotonicity
... We argue that the effect of these proposals can be captured by means of one general, nonmonotonic, operation on feature structures, called default unification.. We provide a formal seman[r] ... See full document
22
Relativity Theory may not have the last Word on the Nature of Time: Quantum Theory and Probabilism
... Our supposition is, then, that this state of affairs will be a feature of the yet-to-be- discovered true, unified "theory of everything" - a unification of probabilistic quantum[r] ... See full document
13
Feature Logic With Weak Subsumption Constraints
... We investigate the extension of basic feature logic with subsumption or matching constraints, based on a weak notion of subsumption.. This mechanism of oneway information flow is general[r] ... See full document
8
Horn Extended Feature Structures: Fast Unification With Negation and Limited Disjunction
... One solution, which has been taken by a number o f authors, such as Kasper 1989 and Eisele and D6rre 1988, is to devise clever algorithms which apply to the general case and appear empir[r] ... See full document
6
XTAG A Graphical Workbench for Developing Tree Adjoining Grammars
... X T A G includes a graphical editor for trees, a graphical tree printer, utilities for manipulating and displaying feature structures for unification-based treeadjoining grammar, facilit[r] ... See full document
8
ON MODELING TRACES IN A COMPUTING ENVIRONMENT FOR HUMAN LEARNING BASED INDICATORS
... first(Ur) :- #min{V:vertex(V)} = Ur. All the atoms derived so far are obtained deterministically, and they are part of every answer set of µ(G) ⋃ P ⋃ {ω}. Conversely, to identify all maximum height spanning trees of G, ... See full document
7
Book Reviews: The Logic of Typed Feature Structures
... 1986 "A logical semantics for feature structures." In Proceedings, 24th Annual Meeting of the Association for Computational Linguistics.. Dowty, Lauri Karttunen, and Arnold M.[r] ... See full document
9
Squibs: On the Universal Generation Problem for Unification Grammars
... for unification grammars is the problem of determin- ing for an arbitrary grammar G and an arbitrary feature structure F whether there exists at least one sentence that G derives with ...acyclic ... See full document
6
Related subjects