Article

Free access

Finding non-local dependencies: beyond pattern matching

Author:

Valentin JijkounAuthors Info & Claims

ACL '03: Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2

Pages 37 - 43

https://doi.org/10.3115/1075178.1075183

Published: 07 July 2003 Publication History

PDF eReader

Abstract

We describe an algorithm for recovering non-local dependencies in syntactic dependency structures. The pattern-matching approach proposed by Johnson (2002) for a similar task for phrase structure trees is extended with machine learning techniques. The algorithm is essentially a classifier that predicts a non-local dependency given a connected fragment of a dependency structure and a set of structural features for this fragment. Evaluating the algorithm on the Penn Treebank shows an improvement of both precision and recall, compared to the results presented in (Johnson, 2002).

References

[1]

Mark Johnson. 2002. A simple pattern-matching algorithm for recovering empty nodes and their antecedents. In Proceedings of the 40th Meeting of the ACL.

Digital Library

Google Scholar

[2]

Jason M. Eisner. 1996. Three new probabilistic models for dependency parsing: An exploration. In Proceedings of the 16th International Conference on Computational Linguistics (COLING), pages 340--345.

Digital Library

Google Scholar

[3]

Michael Collins. 1999. Head-Driven Statistical Models For Natural Language Parsing. Ph.D. thesis, University of Pennsylvania.

Digital Library

Google Scholar

[4]

Sabine Buchholz. 2002. Memory-based grammatical relation finding. Ph.D. thesis, Tilburg University.

Google Scholar

[5]

Walter Daelemans, Jakub Zavrel, Ko van der Sloot, and Antal van den Bosch. 2002. TiMBL: Tilburg Memory Based Learner, version 4.3, Reference Guide. ILK Technical Report 02-10, Available from http://ilk.kub.nl/downloads/pub/papers/ilk0210.ps.gz

Google Scholar

[6]

J. Ross Quinlan. 1993. C4.5: Programs for machine learning. Morgan Kaufmann Publishers.

Digital Library

Google Scholar

[7]

Michael P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313--330.

Digital Library

Google Scholar

[8]

Ted Briscoe, John Carroll, Jonathan Graham and Ann Copestake. 2002. Relational evaluation schemes. In Proceedings of the Beyond PARSEVAL Workshop at LREC 2002, pages 4--8.

Google Scholar

[9]

Stephen Clark, Julia Hockenmaier, and Mark Steedman. 2002. Building deep dependency structures using a wide-coverage CCG parser. In Proceedings of the 40th Meeting of the ACL, pages 327--334.

Digital Library

Google Scholar

Cited By

View all

Schneider GDowdall JRinaldi FPallotta VTodirascu A(2004)A robust and hybrid deep-linguistic theory applied to large-scale parsingProceedings of the 3rd Workshop on RObust Methods in Analysis of Natural Language Data10.5555/1621445.1621448(14-23)Online publication date: 29-Aug-2004
https://dl.acm.org/doi/10.5555/1621445.1621448
Jijkoun Vde Rijke MScott D(2004)Enriching the output of a parser using memory-based learningProceedings of the 42nd Annual Meeting on Association for Computational Linguistics10.3115/1218955.1218995(311-es)Online publication date: 21-Jul-2004
https://dl.acm.org/doi/10.3115/1218955.1218995

Finding non-local dependencies: beyond pattern matching
1. Computing methodologies
  1. Artificial intelligence
2. Hardware
  1. Power and energy
    1. Power estimation and optimization

Recommendations

Iterated dependencies and Kleene iteration
FG'10/FG'11: Proceedings of the 15th and 16th international conference on Formal Grammar

Categorial Dependency Grammars (CDG) is a class of simple and expressive categorial grammars defining projective and discontinuous dependency structures in a strongly compositional way. They are more expressive than CF-grammars, are polynomial time ...
A Study of the Dependencies in Expert Finding
WKDD '10: Proceedings of the 2010 Third International Conference on Knowledge Discovery and Data Mining

Expert finding, the task of identifying experts on a given topic, has received much attention in the last few years. Existing methods try to model the dependencies between the candidate experts and the query terms, which have been proven to be ...
Preserving semantic dependencies in synchronous Tree Adjoining Grammar
ACL '99: Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics

Rambow, Wier and Vijay-Shanker (Rambow et al., 1995) point out the differences between TAG derivation structures and semantic or predicate-argument dependencies, and Joshi and Vijay-Shanker (Joshi and Vijay-Shanker, 1999) describe a monotonic ...

Comments

Information & Contributors

Information

Published In

ACL '03: Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2

July 2003

200 pages

ISBN:0111456789

Program Chair:
Yuji Matsumoto

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 07 July 2003

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 85 of 443 submissions, 19%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
300
Total Downloads

Downloads (Last 12 months)57
Downloads (Last 6 weeks)6

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Schneider GDowdall JRinaldi FPallotta VTodirascu A(2004)A robust and hybrid deep-linguistic theory applied to large-scale parsingProceedings of the 3rd Workshop on RObust Methods in Analysis of Natural Language Data10.5555/1621445.1621448(14-23)Online publication date: 29-Aug-2004
https://dl.acm.org/doi/10.5555/1621445.1621448
Jijkoun Vde Rijke MScott D(2004)Enriching the output of a parser using memory-based learningProceedings of the 42nd Annual Meeting on Association for Computational Linguistics10.3115/1218955.1218995(311-es)Online publication date: 21-Jul-2004
https://dl.acm.org/doi/10.3115/1218955.1218995

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Iterated dependencies and Kleene iteration

A Study of the Dependencies in Expert Finding

Preserving semantic dependencies in synchronous Tree Adjoining Grammar

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations