LFP: a logic for linguistic descriptions and an analysis of its complexity
Computational Linguistics
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
The semantics of grammar formalisms seen as computer languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
The design of a computer language for linguistic information
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
A logic for partially specified data structures
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A flexible graph-unification formalism and its application to natural-language processing
IBM Journal of Research and Development
Computational Linguistics
Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
A parsing algorithm for unification grammar
Computational Linguistics
An interpretation of negation in feature structure descriptions
Computational Linguistics
Computational Linguistics
Syntactic and semantic knowledge in the DELPHI unification grammar
HLT '90 Proceedings of the workshop on Speech and Natural Language
Feature structures and nonmonotonicity
Computational Linguistics - Special issue on inheritance: I
IBM Journal of Research and Development
A practical approach to multiple default inheritance for unification-based lexicons
Computational Linguistics - Special issue on inheritance: II
Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
Phonological analysis in typed feature systems
Computational Linguistics - Special issue on computational phonology
Application of knowledge base design techniques to genetic markers
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
A unified version model for configuration management
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Journal of Logic, Language and Information
Ordering and Path Constraints over Semistructured Data
Journal of Intelligent Information Systems
Dominance Constraints in Context Unification
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Computational Linguistics
Review of "The logic of typed feature structures" by Bob Carpenter. Cambridge University Press 1992.
Computational Linguistics
Computing with features as formulae
Computational Linguistics
Parsing with discontinuous phrases
Natural Language Engineering
Recycling terms into a partial parser
ANLC '94 Proceedings of the fourth conference on Applied natural language processing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Decidability and undecidability in stand-alone feature logics
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A logical treatment of semi-free word order and bounded discontinuous constituency
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Coordination in unification-based grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Classical logics for attribute-value languages
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A logical version of functional grammar
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
A unification method for disjunctive feature descriptions
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Strategies for adding control information to declarative grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Feature logic with weak subsumption constraints
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
A three-valued interpretation of negation in feature structure descriptions
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Tricolor DAGs for machine translation
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
An attributive logic of set descriptions and set operations
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Types in Functional Unification Grammars
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Defaults in unification grammar
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Expressing disjunctive and negative feature constraints with classical first-order logic
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
A model-theoretic framework for theories of syntax
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Conditional descriptions in Functional Unification Grammar
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Unification of disjunctive feature descriptions
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Partial descriptions and systemic grammar
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Unbounded dependency: tying strings to rings
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
QPATR and constraint threading
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Structure sharing problem and its solution in graph unification
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Feature graphs and abstract data types: a unifying approach
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
An algorithm for functional uncertainty
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
An experimental parser for systemic grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Feature structures based Tree Adjoining Grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Generation as structure driven derivation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Data types in computational phonology
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A treatment of negative descriptions of typed feature structures
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Disjunctive feature structures as hypergraphs
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Lexical knowledge acquisition from bilingual corpora
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
JAUNT: a constraint solver for disjunctive feature structures
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Applying lexical rules under subsumption
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Feature logic with disjunctive unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Packing of feature structures for efficient unification of disjunctive feature structures
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Modeling, querying and reasoning about OLAP databases: a functional approach
Proceedings of the 8th ACM international workshop on Data warehousing and OLAP
A notation for policies using feature structures
DPM'10/SETOP'10 Proceedings of the 5th international Workshop on data privacy management, and 3rd international conference on Autonomous spontaneous security
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Hi-index | 0.00 |
Unification-based grammar formalisms use structures containing sets of features to describe linguistic objects. Although computational algorithms for unification of feature structures have been worked out in experimental research, these algorithms become quite complicated, and a more precise description of feature structures is desirable. We have developed a model in which descriptions of feature structures can be regarded as logical formulas, and interpreted by sets of directed graphs which satisfy them. These graphs are, in fact, transition graphs for a special type of deterministic finite automation.This semantics for feature structures extends the ideas of Pereira and Shieber [11], by providing an interpretation for values which are specified by disjunctions and path values embedded within disjunctions. Our interpretation differs from that of Pereira and Shieber by using a logical model in place of a denotational semantics. This logical model yields a calculus of equivalences, which can be used to simplify formulas.Unification is attractive, because of its generality, but it is often computationally inefficient. Our model allows a careful examination of the computational complexity of unification. We have shown that the consistency problem for formulas with disjunctive values is NP-complete. To deal with this complexity, we describe how disjunctive values can be specified in a way which delays expansion to disjunctive normal form.