Survey of the state of the art in human language technology
Survey of the state of the art in human language technology
A Rational Design for a Weighted Finite-State Transducer Library
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Grammatical Trigrams: A Probabilistic Model of Link Grammar
Grammatical Trigrams: A Probabilistic Model of Link Grammar
Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
Coping with ambiguity and unknown words through probabilistic models
Computational Linguistics - Special issue on using large corpora: II
Supertagging: an approach to almost parsing
Computational Linguistics
A stochastic parts program and noun phrase parser for unrestricted text
ANLC '88 Proceedings of the second conference on Applied natural language processing
Building effective queries in natural language information retrieval
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Natural Language Engineering
Regular expressions for language engineering
Natural Language Engineering
Parsing the Wall Street Journal with the inside-outside algorithm
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
New models for improving supertag disambiguation
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Three generative, lexicalised models for statistical parsing
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Exploiting syntactic structure for language modeling
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Structural ambiguity and lexical relations
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Automatic grammar induction and parsing free text: a transformation-based approach
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Statistical decision-tree models for parsing
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
A new statistical parser based on bigram lexical dependencies
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
An alternative conception of tree-adjoining derivation
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
A rule-based approach to prepositional phrase attachment disambiguation
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Disambiguation of super parts of speech (or supertags): almost parsing
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Motivations and methods for text simplification
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
A maximum entropy model for prepositional phrase attachment
HLT '94 Proceedings of the workshop on Human Language Technology
Decision tree parsing using a hidden derivation model
HLT '94 Proceedings of the workshop on Human Language Technology
A test of the leaf-ancestor metric for parse accuracy
Natural Language Engineering
High precision extraction of grammatical relations
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
High precision extraction of grammatical relations
New developments in parsing technology
Multi-tagging for lexicalized-grammar parsing
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
| Hi-index | 0.00 |
In this paper, we present a novel approach to partial parsing that produces dependency links between words of a sentence. The partial parser called a lightweight dependency analyzer uses information encoded in supertags and hence can produce constituency-based as well as dependency-based analyses. The lightweight dependency analyzer has been used for text chunking, including noun and verb group chunking. We also present a proposal for a general framework for parser evaluation that is applicable for evaluating both constituency-based and dependency-based, partial and complete parsers. The performance results of the lightweight dependency analyzer on Wall Street Journal and Brown corpus using the proposed evaluation metrics are discussed.