Search diversification techniques for grammatical inference

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Search diversification techniques for grammatical inference
Συγγραφείς: Spina, Sandro, 3rd Computer Science Annual Workshop (CSAW’05)
Στοιχεία εκδότη: University of Malta. Faculty of ICT
Έτος έκδοσης: 2005
Συλλογή: University of Malta: OAR@UM / L-Università ta' Malta
Θεματικοί όροι: Induction (Mathematics) -- Computer programs, Lattice theory, Inference
Περιγραφή: Grammatical Inference (GI) addresses the problem of learning a grammar G, from a finite set of strings generated by G. By using GI techniques we want to be able to learn relations between syntactically structured sequences. This process of inferring the target grammar G can easily be posed as a search problem through a lattice of possible solutions. The vast majority of research being carried out in this area focuses on non-monotonic searches, i.e. use the same heuristic function to perform a depth first search into the lattice until a hypothesis is chosen. EDSM and S-EDSM are prime examples of this technique. In this paper we discuss the introduction of diversification into our search space [5]. By introducing diversification through pairwise incompatible merges, we traverse multiple disjoint paths in the search lattice and obtain better results for the inference process. ; peer-reviewed
Τύπος εγγράφου: conference object
Γλώσσα: English
Relation: https://www.um.edu.mt/library/oar//handle/123456789/22486
Διαθεσιμότητα: https://www.um.edu.mt/library/oar//handle/123456789/22486
Rights: info:eu-repo/semantics/openAccess ; The copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder.
Αριθμός Καταχώρησης: edsbas.6489D74F
Βάση Δεδομένων: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://www.um.edu.mt/library/oar//handle/123456789/22486#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.6489D74F
RelevancyScore: 850
AccessLevel: 3
PubType: Conference
PubTypeId: conference
PreciseRelevancyScore: 849.67431640625
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Search diversification techniques for grammatical inference
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Spina%2C+Sandro%22">Spina, Sandro</searchLink><br /><searchLink fieldCode="AR" term="%223rd+Computer+Science+Annual+Workshop+%28CSAW%2705%29%22">3rd Computer Science Annual Workshop (CSAW’05)</searchLink>
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: University of Malta. Faculty of ICT
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2005
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: University of Malta: OAR@UM / L-Università ta' Malta
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Induction+%28Mathematics%29+--+Computer+programs%22">Induction (Mathematics) -- Computer programs</searchLink><br /><searchLink fieldCode="DE" term="%22Lattice+theory%22">Lattice theory</searchLink><br /><searchLink fieldCode="DE" term="%22Inference%22">Inference</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Grammatical Inference (GI) addresses the problem of learning a grammar G, from a finite set of strings generated by G. By using GI techniques we want to be able to learn relations between syntactically structured sequences. This process of inferring the target grammar G can easily be posed as a search problem through a lattice of possible solutions. The vast majority of research being carried out in this area focuses on non-monotonic searches, i.e. use the same heuristic function to perform a depth first search into the lattice until a hypothesis is chosen. EDSM and S-EDSM are prime examples of this technique. In this paper we discuss the introduction of diversification into our search space [5]. By introducing diversification through pairwise incompatible merges, we traverse multiple disjoint paths in the search lattice and obtain better results for the inference process. ; peer-reviewed
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: conference object
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: https://www.um.edu.mt/library/oar//handle/123456789/22486
– Name: URL
  Label: Availability
  Group: URL
  Data: https://www.um.edu.mt/library/oar//handle/123456789/22486
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: info:eu-repo/semantics/openAccess ; The copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder.
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.6489D74F
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.6489D74F
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Induction (Mathematics) -- Computer programs
        Type: general
      – SubjectFull: Lattice theory
        Type: general
      – SubjectFull: Inference
        Type: general
    Titles:
      – TitleFull: Search diversification techniques for grammatical inference
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Spina, Sandro
      – PersonEntity:
          Name:
            NameFull: 3rd Computer Science Annual Workshop (CSAW’05)
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2005
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
ResultId 1