Article

Free access

Finite structure query: a tool for querying syntactically annotated corpora

Author:

EACL '03: Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1

Pages 179 - 186

https://doi.org/10.3115/1067807.1067832

Published: 12 April 2003 Publication History

PDF eReader

Abstract

Finite structure query (fsq for short) is a tool for querying syntactically annotated corpora. fsq employs a query language of high expressive power, namely full first order logic. It can be used to query arbitrary finite structures, not just trees.

References

[1]

Anne Abeillé and Lionel Clément. 1999. A tagged reference corpus for French. In Proceedings of EACLLINC.

Google Scholar

[2]

Thorsten Brants, Wojciech Skut, and Hans Uszkoreit. 1999. Syntactic annotation of a German newspaper corpus. In Proceedings of the ATALA Treebank Workshop, pages 69--76.

Google Scholar

[3]

Thorsten Brants. 1997. The NEGRA export format. CLAUS Report 98, Universitüt des Saarlandes, Computerlinguistik, Saarbrücken, Germany.

Google Scholar

[4]

Erhard Hinrichs, Julia Bartels, Yasuhiro Kawata, Valia Kordoni, and Heike Telljohann. 2000. The VERBMOBIL treebanks. In Proceedings of KONVENS 2000.

Digital Library

Google Scholar

[5]

Tilman Höhle. 1985. Der Begriff 'Mittelfeld'. Anmerkungen über die Theorie der topologischen Felder. In A. Schöne, editor, Kontroversen, alte und neue. Akten des 7. Internationalen Germanistenkongresses, pages 329--340.

Google Scholar

[6]

Laura Kallmeyer and Ilona Steiner. 2003. Querying treebanks of spontaneous speech with VIQTORYA. Traitement Automatique des Langues, 43(2).

Google Scholar

[7]

Esther König and Wolfgang Lezius. 2000. A description language for syntactically annotated corpora. In Proceedings of the COLING Conference, pages 1056--1060.

Digital Library

Google Scholar

[8]

Mitchell 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

[9]

Jiří Mírovský, Roman Ondruška, and Daniel Průša. 2002. Searching through Prague Dependency Treebank. In Erhard Hinrichs and Kiril Simov, editors, Proceedings of Treebanks and Linguistic Theories, pages 114--122.

Google Scholar

[10]

Oliver Plaehn and Thorsten Brants. 2000. Annotate -- an efficient interactive annotation tool. In Sixth Conference on Applied Natural Language Processing (ANLP-2000).

Google Scholar

[11]

Beth Randall. 2000. CorpusSearch user's manual. Technical report, University of Pennsylvania. http://www.ling.upenn.edu/mideng/ppcme2dir/.

Google Scholar

[12]

Douglas Rohde. 2001. Tgrep2. Technical report, Carnegie Mellon University. http://tedlab. mit.edu/~dr/Tgrep2/.

Google Scholar

[13]

Anne Schiller, Simone Teufel, and Christine Thielen. 1995. Guidelines für das Tagging deutscher Textcorpora mit STTS. Manuscript, Universities of Stuttgart and Tübingen.

Google Scholar

[14]

Rosmary Stegmann, Heike Telljohann, and Erhard Hinrichs. 2000. Stylebook for the German tree-bank in VERBMOBIL. Technical Report 239, SfS, University of Tübingen.

Google Scholar

[15]

Alexei Stolboushkin and Michael Taitslin. 1994. Is first order contained in an initial segment of PTIME? In Leszek Pacholski and Jerzy Tiuryn, editors, Proceedings CSL, volume LNCS 933, pages 242--248. Springer.

Digital Library

Google Scholar

[16]

Moshe Vardi. 1982. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on Theory of Computing, pages 137--146.

Digital Library

Google Scholar

[17]

Sean Wallis and Gerald Nelson. 2000. Exploiting fuzzy tree fragment queries in the investigation of parsed corpora. Literary and Linguistic Computing, 15(3):339--361.

Crossref

Google Scholar

Cited By

View all

Kepser S(2019)Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear TimeJournal of Logic, Language and Information10.1007/s10849-004-2116-813:4(457-470)Online publication date: 13-Nov-2019
https://dl.acm.org/doi/10.1007/s10849-004-2116-8
Bouma GXue NPoesio M(2010)Syntactic tree queries in PrologProceedings of the Fourth Linguistic Annotation Workshop10.5555/1868720.1868754(212-216)Online publication date: 15-Jul-2010
https://dl.acm.org/doi/10.5555/1868720.1868754
Ghodke SBird SKaplan R(2010)Fast query for large treebanksHuman Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics10.5555/1857999.1858033(267-275)Online publication date: 2-Jun-2010
https://dl.acm.org/doi/10.5555/1857999.1858033
Show More Cited By

Finite structure query: a tool for querying syntactically annotated corpora
1. Information systems
  1. Data management systems
    1. Database management system engines
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory

Recommendations

Finite representation of infinite query answers

We define here a formal notion of finite representation of infinite query answers in logic programs. We apply this notion to Datalog_nS programs may be infinite and consequently queries may have infinite answers.

We present a method to finitely represent ...
Query automata over finite trees

A main task in document transformation and information retrieval is locating subtrees satisfying some pattern. Therefore, unary queries, i.e., queries that map a tree to a set of its nodes, play an important role in the context of structured document ...
View-based query containment
PODS '03: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Query containment is the problem of checking whether for all databases the answer to a query is a subset of the answer to a second query. In several data management tasks, such as data integration, mobile computing, etc., the data of interest are only ...

Comments

Information & Contributors

Information

Published In

EACL '03: Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1

April 2003

394 pages

ISBN:1333567890

Program Chairs:
Ann Copestake
United Kingdom
,
Jan Hajic
Czech Republic

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 12 April 2003

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
194
Total Downloads

Downloads (Last 12 months)23
Downloads (Last 6 weeks)1

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kepser S(2019)Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear TimeJournal of Logic, Language and Information10.1007/s10849-004-2116-813:4(457-470)Online publication date: 13-Nov-2019
https://dl.acm.org/doi/10.1007/s10849-004-2116-8
Bouma GXue NPoesio M(2010)Syntactic tree queries in PrologProceedings of the Fourth Linguistic Annotation Workshop10.5555/1868720.1868754(212-216)Online publication date: 15-Jul-2010
https://dl.acm.org/doi/10.5555/1868720.1868754
Ghodke SBird SKaplan R(2010)Fast query for large treebanksHuman Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics10.5555/1857999.1858033(267-275)Online publication date: 2-Jun-2010
https://dl.acm.org/doi/10.5555/1857999.1858033
Lai CBird S(2010)Querying Linguistic TreesJournal of Logic, Language and Information10.1007/s10849-009-9086-919:1(53-73)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.1007/s10849-009-9086-9
Kepser SMooney R(2005)Using MONA for querying linguistic treebanksProceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing10.3115/1220575.1220645(555-562)Online publication date: 6-Oct-2005
https://dl.acm.org/doi/10.3115/1220575.1220645

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

Finite representation of infinite query answers

Query automata over finite trees

View-based query containment

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations