Formal languages
Discrete-time signal processing
Discrete-time signal processing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
An efficient context-free parsing algorithm
Communications of the ACM
Transition network grammars for natural language analysis
Communications of the ACM
How features resolve syntactic ambiguity
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
Introduction to Formal Language Theory
Introduction to Formal Language Theory
ON MEMORY LIMITATIONS IN NATURAL LANGUAGE PROCESSING
ON MEMORY LIMITATIONS IN NATURAL LANGUAGE PROCESSING
PRELIMINARY ANALYSIS OF A BREADTH-FIRST PARSING ALGORITHM: THEORETICAL AND EXPERIMENTAL RESULTS
PRELIMINARY ANALYSIS OF A BREADTH-FIRST PARSING ALGORITHM: THEORETICAL AND EXPERIMENTAL RESULTS
Transportable natural language processing through simplicity—the PRE system
ACM Transactions on Information Systems (TOIS)
Synergistic use of direct manipulation and natural language
CHI '89 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Parsing with flexibility, dynamic strategies, and idioms in mind
Computational Linguistics
Practical parsing of generalized phrase structure grammars
Computational Linguistics
Finite-state approximations of grammars
HLT '90 Proceedings of the workshop on Speech and Natural Language
The role of natural language in a multimodal interface
UIST '92 Proceedings of the 5th annual ACM symposium on User interface software and technology
Stroing logical form in a shared-packed forest
Computational Linguistics
Coping with Different Types of Ambiguity Using a Uniform Context Handling Mechanism
NLDB '00 Proceedings of the 5th International Conference on Applications of Natural Language to Information Systems-Revised Papers
Context-Based Ambiguity Management for Natural Language Processing
CONTEXT '01 Proceedings of the Third International and Interdisciplinary Conference on Modeling and Using Context
On the mathematical properties of linguistic theories
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Computational Linguistics - Special issue on using large corpora: I
The interface between phrasal and functional constraints
Computational Linguistics
Localizing expression of ambiguity
ANLC '88 Proceedings of the second conference on Applied natural language processing
Canonical representation in NLP system design: a critical evaluation
ANLC '88 Proceedings of the second conference on Applied natural language processing
Compound nouns in a unification-based MT system
ANLC '92 Proceedings of the third conference on Applied natural language processing
The syntactic regularity of English noun phrases
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Coping with dynamic syntactic strategies: an experimental environment for an experimental parser
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
Finite-state approximation of phrase structure grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Structural disambiguation with constraint propagation
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Head automata and bilingual tiling: translation with minimal representations
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Linear encodings of linguistic analyses
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Incremental construction of c- and f-structure in a LFG-parser
COLING '86 Proceedings of the 11th coference on Computational linguistics
JAUNT: a constraint solver for disjunctive feature structures
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Is it harder to parse Chinese, or the Chinese Treebank?
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Semantic classes and syntactic ambiguity
HLT '93 Proceedings of the workshop on Human Language Technology
Using the web as an implicit training set: application to structural ambiguity resolution
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Statistical machine translation
ACM Computing Surveys (CSUR)
Faster Scannerless GLR Parsing
CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Prepositions in applications: A survey and introduction to the special issue
Computational Linguistics
Translation as weighted deduction
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
An on-line computational model of human sentence interpretation
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Using web-scale N-grams to improve base NP parsing performance
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Active learning for dependency parsing using partially annotated sentences
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
| Hi-index | 0.00 |
Sentences are far more ambiguous than one might have thought. There may be hundreds, perhaps thousands, of syntactic parse trees for certain very natural sentences of English. This fact has been a major problem confronting natural language processing, especially when a large percentage of the syntactic parse trees are enumerated during semantic/pragmatic processing. In this paper we propose some methods for dealing with syntactic ambiguity in ways that exploit certain regularities among alternative parse trees. These regularities will be expressed as linear combinations of ATN networks, and also as sums and products of formal power series. We believe that such encoding of ambiguity will enhance processing, whether syntactic and semantic constraints are processed separately in sequence or interleaved together.