Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
Determining the Scope of English Quantifiers
Determining the Scope of English Quantifiers
ON MEMORY LIMITATIONS IN NATURAL LANGUAGE PROCESSING
ON MEMORY LIMITATIONS IN NATURAL LANGUAGE PROCESSING
Deterministic parsing of syntactic non-fluencies
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Attention, intentions, and the structure of discourse
Computational Linguistics
Syntactic graphs: a representation for the union of all ambiguous parse trees
Computational Linguistics
Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
Stroing logical form in a shared-packed forest
Computational Linguistics
An efficient algorithm for the configuration problem of dominance graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Journal of Logic, Language and Information
Talking about Trees and Truth-Conditions
Journal of Logic, Language and Information
Dominance constraints with Boolean connectives: a model-eliminative treatment
Theoretical Computer Science - Algebraic methods in language processing
Dominance Constraints in Context Unification
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Dominance Constraints with Set Operators
CL '00 Proceedings of the First International Conference on Computational Logic
Dominance Constraints: Algorithms and Complexity
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Parallelism and Tree Regular Constraints
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Review of "The logic of typed feature structures" by Bob Carpenter. Cambridge University Press 1992.
Computational Linguistics
Computing with features as formulae
Computational Linguistics
Computational Linguistics
Semantic interpretation of deverbal nominalizations
Natural Language Engineering
Canonical representation in NLP system design: a critical evaluation
ANLC '88 Proceedings of the second conference on Applied natural language processing
Incremental interpretation of Categorial Grammar
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Incorporating "unconscious reanalysis" into an incremental, monotonic parser
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Extended access to the left context in an ATN parser
EACL '83 Proceedings of the first conference on European chapter of the 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
Constraints over Lambda-Structures in semantic underspecification
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Japanese prosodic phrasing and intonation synthesis
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Acquiring disambiguation rules from text
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
On determining the consistency of partial descriptions of trees
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Multiset-valued linear index grammars: imposing dominance constraints on derivations
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Reasoning with descriptions of trees
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
A connectionist parser for Structure Unification Grammar
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
A new algorithm for normal dominance constraints
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An efficient graph algorithm for dominance constraints
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
On underspecified processing of dynamic semantics
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Incremental interpretation: applications, theory, and relationship to dynamic semantics
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Generalized memory manipulating actions for parsing natural language
COLING '86 Proceedings of the 11th coference on Computational linguistics
Conjunctive queries over trees
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Well-nested parallelism constraints for ellipsis resolution
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
An algorithm for aspects of semantic interpretation using an enhanced WordNet
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
Distributing representation for robust interpretation of dialogue utterances
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
A polynomial-time fragment of dominance constraints
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Conjunctive queries over trees
Journal of the ACM (JACM)
Dominance constraints in stratified context unification
Information Processing Letters
Determining the consistency of partial tree descriptions
Artificial Intelligence
Parsing with assertion sets and information monotonicity
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
On the computational complexity of dominance links in grammatical formalisms
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Research on Language and Computation
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
Semantic interpretation of nominalizations
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Regular growth automata: properties of a class of finitely induced infinite machines
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Describing lambda terms in context unification
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
Linguists, including computational linguists, have always been fond of talking about trees. In this paper, we outline a theory of linguistic structure which talks about talking about trees; we call this theory Description theory (D-theory). While important issues must be resolved before a complete picture of D-theory emerges (and also before we can build programs which utilize it), we believe that this theory will ultimately provide a framework for explaining the syntax and semantics of natural language in a manner which is intrinsically computational. This paper will focus primarily on one set of motivations for this theory, those engendered by attempts to handle certain syntactic phenomena within the framework of deterministic parsing.