Using MONA for querying linguistic treebanks

Authors:
Stephan Kepser
Affiliations:
University of Tübingen, Tübingen, Germany
Venue:
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Year:
2005

Citing 8
Cited 0

Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
Tree languages

Handbook of formal languages, vol. 3
The VERBMOBIL Treebanks

KONVENS 2000 / Sprachkommunikation, Vorträge der gemeinsamen Veranstaltung 5. Konferenz zur Verarbeitung natürlicher Sprache (KONVENS), 6. ITG-Fachtagung "Sprachkommunikation"
Mona & Fido: The Logic-Automaton Connection in Practice

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Building a large annotated corpus of English: the penn treebank

Computational Linguistics - Special issue on using large corpora: II
A description language for syntactically annotated corpora

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear Time

Journal of Logic, Language and Information
Finite structure query: a tool for querying syntactically annotated corpora

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

MONA is an automata toolkit providing a compiler for compiling formulae of monadic second order logic on strings or trees into string automata or tree automata. In this paper, we evaluate the option of using MONA as a treebank query tool. Unfortunately, we find that MONA is not an option. There are several reasons why the main being unsustainable query answer times. If the treebank contains larger trees with more than 100 nodes, then even the processing of simple queries may take hours.