Approximate schemas, source-consistency and query answering.
Saved in:
| Title: | Approximate schemas, source-consistency and query answering. |
|---|---|
| Authors: | de Rougemont, Michel1 mdr@lri.fr, Vieilleribière, Adrien2 vieille@lri.fr |
| Source: | Journal of Intelligent Information Systems. Oct2008, Vol. 31 Issue 2, p127-146. 20p. 8 Diagrams. |
| Subjects: | Language & languages, Extinct languages, Computer science, Logic, Schemas (Psychology), Statistics |
| Abstract: | We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are ε-close if every word (tree) of one language is ε-close to the other. A transducer model is introduced to compare tree languages (schemas) with different alphabets and attributes. Using the statistical embedding of Fischer et al. (Proceedings of 21st IEEE Symposium on Logic in Computer Science, pp. 421–430, ), we show that Source-Consistency and Approximate Query Answering are testable on words and trees, i.e. can be approximately decided within ε by only looking at a constant fraction of the input. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Intelligent Information Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 34148469 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Approximate schemas, source-consistency and query answering. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22de+Rougemont%2C+Michel%22">de Rougemont, Michel</searchLink><relatesTo>1</relatesTo><i> mdr@lri.fr</i><br /><searchLink fieldCode="AR" term="%22Vieilleribière%2C+Adrien%22">Vieilleribière, Adrien</searchLink><relatesTo>2</relatesTo><i> vieille@lri.fr</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Intelligent+Information+Systems%22">Journal of Intelligent Information Systems</searchLink>. Oct2008, Vol. 31 Issue 2, p127-146. 20p. 8 Diagrams. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Language+%26+languages%22">Language & languages</searchLink><br /><searchLink fieldCode="DE" term="%22Extinct+languages%22">Extinct languages</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+science%22">Computer science</searchLink><br /><searchLink fieldCode="DE" term="%22Logic%22">Logic</searchLink><br /><searchLink fieldCode="DE" term="%22Schemas+%28Psychology%29%22">Schemas (Psychology)</searchLink><br /><searchLink fieldCode="DE" term="%22Statistics%22">Statistics</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are ε-close if every word (tree) of one language is ε-close to the other. A transducer model is introduced to compare tree languages (schemas) with different alphabets and attributes. Using the statistical embedding of Fischer et al. (Proceedings of 21st IEEE Symposium on Logic in Computer Science, pp. 421–430, ), we show that Source-Consistency and Approximate Query Answering are testable on words and trees, i.e. can be approximately decided within ε by only looking at a constant fraction of the input. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of Intelligent Information Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=34148469 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10844-008-0060-9 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 20 StartPage: 127 Subjects: – SubjectFull: Language & languages Type: general – SubjectFull: Extinct languages Type: general – SubjectFull: Computer science Type: general – SubjectFull: Logic Type: general – SubjectFull: Schemas (Psychology) Type: general – SubjectFull: Statistics Type: general Titles: – TitleFull: Approximate schemas, source-consistency and query answering. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: de Rougemont, Michel – PersonEntity: Name: NameFull: Vieilleribière, Adrien IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 10 Text: Oct2008 Type: published Y: 2008 Identifiers: – Type: issn-print Value: 09259902 Numbering: – Type: volume Value: 31 – Type: issue Value: 2 Titles: – TitleFull: Journal of Intelligent Information Systems Type: main |
| ResultId | 1 |
