KONVENS 2000 / Sprachkommunikation, Vorträge der gemeinsamen Veranstaltung 5. Konferenz zur Verarbeitung natürlicher Sprache (KONVENS), 6. ITG-Fachtagung "Sprachkommunikation"
Is First Order Contained in an Initial Segment of PTIME?
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
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
Using MONA for querying linguistic treebanks
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Journal of Logic, Language and Information
Fast query for large treebanks
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Syntactic tree queries in Prolog
LAW IV '10 Proceedings of the Fourth Linguistic Annotation Workshop
Tree pattern expression for extracting information from syntactically parsed text corpora
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
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.