5,226 Hits in 3.3 sec

A query tool for syntactically annotated corpora

Laura Kallmeyer
2000 Proceedings of the 2000 Joint SIGDAT conference on Empirical methods in natural language processing and very large corpora held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics -  
The tool uses a query language that allows to search for tokens, syntactic categories, grammatical functions and binary relations of (immediate) dominance and linear precedence between nodes.  ...  The query tool is developed to search the Verbmobil treebanks annotated at the University of Tfibingen.  ...  of the binary relations are not part of the database schema, e.g. considering only the database, the dominance and linear precedence relations are not necessarily trA.n~itive.  ... 
doi:10.3115/1117794.1117818 dblp:conf/emnlp/Kallmeyer00 fatcat:dyox3zr5sbcndfbwj4uyvfgtz4

A Novel Approach Towards Building a Portable NLIDB System Using the Computational Paninian Grammar Framework

Abhijeet Gupta, Arjun Akula, Deepak Malladi, Puneeth Kukkadapu, Vinay Ainavolu, Rajeev Sangal
2012 2012 International Conference on Asian Language Processing  
It uses two distinct stages of processing, namely, syntactic processing followed by semantic processing. Syntactic processing makes the processing more general and robust.  ...  This paper presents a novel approach to building natural language interface to databases (NLIDB) based on Computational Paninian Grammar (CPG).  ...  elements in the database schema.  ... 
doi:10.1109/ialp.2012.16 dblp:conf/ialp/GuptaAMKAS12 fatcat:iqoahobv25fjnfhkgwuswkfdym

Expressiveness and complexity of XML Schema

Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex
2006 ACM Transactions on Database Systems  
Our characterizations show that, in terms of expressive power, XML Schema lies between DTDs and general tree automata.  ...  To shed some light on the actual expressive power of XML Schema, intuitive semantical characterizations of the Element Declarations Consistent (EDC) rule are provided.  ...  We thank the anonymous referees whose thorough comments and suggestions improved the presentation of the paper.  ... 
doi:10.1145/1166074.1166076 fatcat:vkhzysyvevfwzmbvsdd42742fu

JWOLF: Java Free French Wordnet Library

Morad HAJJI, Mohammed QBADOU, Khalifa MANSOURI
2019 International Journal of Advanced Computer Science and Applications  
in this database, such as: the tree of hypernymy, the tree of hyponymy, synonyms, etc.  ...  However, no effort is made to facilitate the exploitation of this database under the Java language.  ...  The WordNet database consists of several files listed by syntactic categories (grammatical classes).  ... 
doi:10.14569/ijacsa.2019.0100245 fatcat:evof6hyxufechmu4lkmqbsco6m

Semantic matching

2003 Knowledge engineering review (Print)  
,N2; where ID ij is a unique identifier of the given mapping element; n1 i is the i-th node of the first graph, N1 is the number of nodes in the first graph; n2 j is the j-th node of the second graph,  ...  N2 is the number of nodes in the second graph; and R specifies a semantic relation which is supposed to hold between the concepts at nodes n1 i and n2 j .  ...  Syntactic are those approaches that rely on purely syntactic matching methods, e.g., edit distance between strings, tree edit distance.  ... 
doi:10.1017/s0269888904000074 fatcat:anhpfuhg6nbrnixbyczot2i5i4

Consistent query answering under primary keys

Jef Wijsen
2009 Proceedings of the 12th International Conference on Database Theory - ICDT '09  
The repairs of an inconsistent database db are obtained by selecting a maximum number of tuples from db without ever selecting two tuples that agree on their primary key.  ...  q evaluates to true on every repair of db?  ...  All constructs that follow are defined relative to a fixed database schema. A database (over a database schema) is a finite set db of ground atoms using only the relation names of the schema.  ... 
doi:10.1145/1514894.1514900 dblp:conf/icdt/Wijsen09 fatcat:gngrjidexbeeziogjzmojah7fi

Extending Sticky-Datalog+/- via Finite-Position Selection Functions: Tractability, Algorithms, and Optimization [article]

Leopoldo Bertossi, Mostafa Milani
2021 arXiv   pre-print
Program classes with selection functions include Sticky and WS, and another syntactic class that we introduce and characterize, namely JWS, of jointly-weakly-sticky programs, which contains WS.  ...  Weakly-Sticky(WS) Datalog+/- is an expressive member of the family of Datalog+/- program classes that is defined on the basis of the conditions of stickiness and weak-acyclicity.  ...  The proof-tree in Figure 9 (a) is an instance of this proof-tree schema.  ... 
arXiv:2108.00903v2 fatcat:3teqqzkoxvgetgc3fzibwgs7si

A Survey of Schema-Based Matching Approaches [chapter]

Pavel Shvaiko, Jérôme Euzenat
2005 Lecture Notes in Computer Science  
In particular, we distinguish between approximate and exact techniques at schema-level; and syntactic, semantic, and external techniques at element-and structure-level.  ...  In this paper we present a new classification of schema-based matching techniques that builds on the top of state of the art in both schema and ontology matching.  ...  Acknowledgements: This work has been partly supported by the Knowledge Web European network of excellence (IST-2004-507482).  ... 
doi:10.1007/11603412_5 fatcat:givft2xinzaofbvtkmeoaubqbq

A Survey of Schema Matching Research using Database Schemas and Instances

Ali A., Azlin Nordin, Mogahed Alzeber, Abedallah Zaid
2017 International Journal of Advanced Computer Science and Applications  
Schema matching is considered as one of the essential phases of data integration in database systems.  ...  This paper set out a classification of schema matching research in database system exploiting database schema and instances.  ...  The first method relies on the syntactic facts of the database schema to generate regular expressions or sample values that result into characterizing the concepts of ontology by their instance sets.  ... 
doi:10.14569/ijacsa.2017.081014 fatcat:syxrqqmaebawvbhvz7gez2vnbu

Characterising Fixed Parameter Tractability of Query Evaluation over Guarded TGDs [article]

Cristina Feier
2021 arXiv   pre-print
for unrestricted-arity schemas) and treewidth (according to the well known result of Grohe for bounded-arity schemas).  ...  Previously, in the case of bounded arity schemas, this has been tackled using a technique requiring full introspection into the construction employed by Grohe.  ...  Based on these notions, for OMQs from (GDLog, UCQ), we establish a syntactic characterization of the fpt border: Main Result 2.  ... 
arXiv:2101.11727v2 fatcat:3gptbbc6w5cqbebtkdmblccfaq

A data management strategy for transportable natural language interfaces

Julia A. Johnson, Richard S. Rosenberg
1995 International Journal of Intelligent Systems  
The second request of the pair can be interpreted by substituting "of Mathematics" for "of Computer Science" in the parse tree for the first request.  ...  domain expressed by the SET schema. 2 A DB schema describes a particular organization of the data in the database.  ...  The syntactic component (parser) produces a collection of parse trees from NL inputs.  ... 
doi:10.1002/int.4550100902 fatcat:7oncdskesbg7doiury4kpnpwsu

Conversational querying

Yannis E. Ioannidis, Stratis D. Viglas
2006 Information Systems  
Disambiguation is achieved by using various types of semantic information. The overall method works independently of the domain under which it is used (i.e., independently of the database schema).  ...  The results have been encouraging, especially when semantic knowledge from the schema is exploited, laying a potential foundation for conversational querying in databases. r  ...  Acknowledgements We are indebted to the anonymous reviewers for a large number of useful comments in the earlier versions of this paper. We would also like to thank Dr. Anya Sotiropoulou, Dr.  ... 
doi:10.1016/ fatcat:xnkqej3vhrbefa3kukrz4r64ci

The Impact of XML Databases Normalization on Design and Usability of Internet Applications

Samir Abou El-Seoud, Hosam F. El-Sofany, Fayed F. M. Ghaleb
2010 International Journal of Advanced Corporate Learning  
We show that an XML tree can be represented as a set of tree tuples.  ...  Our goal is to find a way for converting an arbitrary XML Schema to a well-designed one that avoids these problems. We extend the notion of tuple for relational databases to the XML model.  ...  This theory concerns the old question of well-designed databases or in other words the syntactic characterization of semantically desirable properties.  ... 
doi:10.3991/ijac.v3i2.1265 fatcat:d24gsapzzbasdj6u23lgfugxuy

A Survey to View Update Problem

Haitao Chen, Husheng Liao
2011 Journal of clean energy technologies  
For a long time, the view update problem is an open question in database community. With the development of various data models, the corresponding view update problem has been widely researched.  ...  In this paper, we introduce the conception of view update problem. We survey and compare previous approaches. Especially, we emphasize the role of semantics.  ...  Definition 1: XML database is a set of XML Schema, which is denoted by X.  ... 
doi:10.7763/ijcte.2011.v3.278 fatcat:fjsooybx55h53jtiaerqadpzs4

Publish By Example

Sonia Guéhis, David Gross-Amblard, Philippe Rigaux
2008 2008 Eighth International Conference on Web Engineering  
We propose an approach for producing database publishing programs by example. The main idea is to interactively build an example document, representative of the program output.  ...  The end-user does not need to know a programming language, a query language or the database schema. Eighth International Conference on Web Engineering 978-0-7695-3261-5/08 $25.00  ...  SQL); (iii) the database schema.  ... 
doi:10.1109/icwe.2008.19 dblp:conf/icwe/GuehisGR08 fatcat:w6oo6jtdljf75aqddcuykumfva
« Previous Showing results 1 — 15 out of 5,226 results