An efficient context-free parsing algorithm
Communications of the ACM
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
A study of tree adjoining grammars
A study of tree adjoining grammars
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
Some computational properties of Tree Adjoining Grammars
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
An Earley-type parsing algorithm for Tree Adjoining Grammars
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Feature structures based Tree Adjoining Grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Lexicalized TAGs, parsing and lexicons
HLT '89 Proceedings of the workshop on Speech and Natural Language
Tree-adjoining grammar parsing and boolean matrix multiplication
Computational Linguistics
The computational complexity of the correct-prefix property for TAGs
Computational Linguistics
The use of shared forests in tree adjoining grammar parsing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Parsing idioms in lexicalized TAGs
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Tabular algorithms for TAG parsing
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Bidirectional parsing of lexicalized tree adjoining grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A structure-sharing parser for lexicalized grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
TAL recognition in O(M(n2)) time
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Deterministic left to right parsing of Tree Adjoining Languages
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
An Earley-type parsing algorithm for Tree Adjoining Grammars
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Parsing French with Tree Adjoining Grammar: some linguistic accounts
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Feature structures based Tree Adjoining Grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Coordination in Tree Adjoining Grammars: formalization and implementation
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
An evaluation of lexicalization in parsing
HLT '89 Proceedings of the workshop on Speech and Natural Language
GenI: natural language generation in Haskell
Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Pythia: compositional meaning construction for ontology-based question answering on the semantic web
NLDB'11 Proceedings of the 16th international conference on Natural language processing and information systems
On Using Semi-Dyck Sets To Analyse Coupled-Context-Free Languages
Fundamenta Informaticae
| Hi-index | 0.00 |
We will describe an Earley-type parser for Tree Adjoining Grammars (TAGs). Although a CKY-type parser for TAGs has been developed earlier (Vijay-Shanker and Joshi, 1985), this is the first practical parser for TAGs because as is well known for CFGs, the average behavior of Earley-type parsers is superior to that of CKY-type parsers. The core of the algorithm is described. Then we discuss modifications of the parsing algorithm that can parse extensions of TAGs such as constraints on adjunction, substitution, and feature structures for TAGs. We show how with the use of substitution in TAGs the system is able to parse directly CFGs and TAGs. The system parses unification formalisms that have a CFG skeleton and also those with a TAG skeleton. Thus it also allows us to embed the essential aspects of PATR-II.