A study of tree adjoining grammars
A study of tree adjoining grammars
Lexicon-grammar and the syntactic analysis of French
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
Using restriction to extend parsing algorithms for complex-feature-based formalisms
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
Parsing French with Tree Adjoining Grammar: some linguistic accounts
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
Lexicalized TAGs, parsing and lexicons
HLT '89 Proceedings of the workshop on Speech and Natural Language
The mapping unit approach to subcategorization
HLT '91 Proceedings of the workshop on Speech and Natural Language
Fixed and flexible phrase structure: coordination in tree adjoining grammars
HLT '91 Proceedings of the workshop on Speech and Natural Language
Two recent developments in tree adjoining grammars: semantics and efficient processing
HLT '90 Proceedings of the workshop on Speech and Natural Language
Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
A note on typing feature structures
Computational Linguistics
Lexicalized Proof-Nets and TAGs
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Probabilistic Head-Driven Chart Parsing of Czech Sentences
TDS '00 Proceedings of the Third International Workshop on Text, Speech and Dialogue
Towards a Natural Language Driven Automated Help Desk
CICLing '02 Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing
An Automatic Speech Translation System on PDAs for Travel Conversation
ICMI '02 Proceedings of the 4th IEEE International Conference on Multimodal Interfaces
Computational Linguistics
Supertagging: an approach to almost parsing
Computational Linguistics
A lightweight dependency analyzer for partial parsing
Natural Language Engineering
The Delphi natural language understanding system
ANLC '94 Proceedings of the fourth conference on Applied natural language processing
Natural Language Engineering
XTAG: a graphical workbench for developing tree-adjoining grammars
ANLC '92 Proceedings of the third conference on Applied natural language processing
Parsing idioms in lexicalized TAGs
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Long-distance scrambling and tree adjoining grammars
EACL '91 Proceedings of the fifth 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
An efficient kernel for multilingual generation in speech-to-speech dialogue translation
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Separating surface order and syntactic relations in a dependency grammar
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Building parallel LTAG for French and Italian
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
An empirical evaluation of Probabilistic Lexicalized Tree Insertion Grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Lexicalized context-free grammars
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Some novel applications of Explanation-Based Learning to parsing Lexicalized Tree-Adjoining Grammars
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Capturing CFLs with Tree Adjoining Grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Optimizing the computational lexicalization of large grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Licensing and Tree Adjoining Grammar in Government Binding parsing
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Lexical and syntactic rules in a Tree Adjoining Grammar
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Pattern-based context-free grammars for machine translation
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Generating an LTAG out of a principle-based hierarchical representation
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
A functional approach to generation with TAG
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Using lexicalized tags for machine translation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
XTAG system: a wide coverage grammar for English
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Portuguese analysis with Tree Adjoining Grammars
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Parsing French with Tree Adjoining Grammar: some linguistic accounts
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Disambiguation of super parts of speech (or supertags): almost parsing
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Concurrent lexicalized dependency parsing: the ParseTalk model
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Synchronous tags and French pronominal clitics
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Structure sharing in lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Stochastic lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
A principle-based hierarchical representation of LTAGs
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Restricted parallelism in object-oriented lexical parsing
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Lexicalized Tree Automata-based Grammars for translating conversational texts
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Motivations and methods for text simplification
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Pattern-based machine translation
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Efficient parsing for bilexical context-free grammars and head automaton grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Lexicalized grammar acquisition
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 2
A speech translation system with mobile wireless clients
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Comparison between CFG filtering techniques for LTAG and HPSG
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
An evaluation of lexicalization in parsing
HLT '89 Proceedings of the workshop on Speech and Natural Language
Stochastic tree-adjoining grammars
HLT '91 Proceedings of the workshop on Speech and Natural Language
An analogical parser for restricted domains
HLT '91 Proceedings of the workshop on Speech and Natural Language
Prediction of lexicalized tree fragments in text
HLT '93 Proceedings of the workshop on Human Language Technology
STAR '01 Proceedings of the ACL 2001 Workshop on Sharing Tools and Resources - Volume 15
A model of syntactic disambiguation based on lexicalized grammars
CONLL '03 Proceedings of the seventh conference on Natural language learning at HLT-NAACL 2003 - Volume 4
Automated extraction of tags from the penn treebank
New developments in parsing technology
Automated extraction of Tree-Adjoining Grammars from treebanks
Natural Language Engineering
Proceedings of the 12th international conference on Intelligent user interfaces
Deep linguistic analysis for the accurate identification of predicate-argument relations
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
An automatic speech translation system for travel conversation
HLT '02 Proceedings of the second international conference on Human Language Technology Research
Towards portable natural language interfaces to knowledge bases - The case of the ORAKEL system
Data & Knowledge Engineering
The Non-associativity of Polarized Tree-Based Grammars
CICLing '07 Proceedings of the 8th International Conference on Computational Linguistics and Intelligent Text Processing
Are very large context-free grammars tractable?
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Porting a lexicalized-grammar parser to the biomedical domain
Journal of Biomedical Informatics
Corpus-oriented development of Japanese HPSG parsers
ACLstudent '05 Proceedings of the ACL Student Research Workshop
Filtering errors and repairing linguistic anomalies for spoken dialogue systems
ISDS '97 Interactive Spoken Dialog Systems on Bringing Speech and NLP Together in Real Applications
Probabilistic models for disambiguation of an HPSG-based chart generator
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Computational linguistics and natural language processing
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
Strong lexicalization of tree adjoining grammars
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Mildly non-projective dependency grammar
Computational Linguistics
Hi-index | 0.00 |
In this paper we present a general parsing strategy that arose from the development of an Earley-type parsing algorithm for TAGs (Schabes and Joshi 1988) and from recent linguistic work in TAGs (Abeille 1988).In our approach elementary structures are associated with their lexical heads. These structures specify extended domains of locality (as compared to a context-free grammar) over which constraints can be stated. These constraints either hold within the elementary structure itself or specify what other structures can be composed with a given elementary structure.We state the conditions under which context-free based grammars can be 'lexicalized' without changing the linguistic structures originally produced. We argue that even if one extends the domain of locality of CFGs to trees, using only substitution does not give the freedom to choose the head of each structure. We show how adjunction allows us to 'lexicalize' a CFG freely.We then show how a 'lexicalized' grammar naturally follows from the extended domain of locality of TAGs and present some of the linguistic advantages of our approach.A novel general parsing strategy for 'lexicalized' grammars is discussed. In a first stage, the parser builds a set structures corresponding to the input sentence and in a second stage, the sentence is parsed with respect to this set. The strategy is independent of the linguistic theory adopted and of the underlying grammar formalism. However, we focus our attention on TAGs. Since the set of trees needed to parse an input sentence is supposed to be finite, the parser can use in principle any search strategy. Thus, in particular, a top-down strategy can be used since problems due to recursive structures are eliminated. The parser is also able to use non-local information to guide the search.We then explain how the Earley-type parser for TAGs can be modified to take advantage of this approach.