Classifying Words with 3-sort Automata

Tomasz Jastrząb; Frédéric Lardeux; Éric Monfroy

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Classifying Words with 3-sort Automata

Topics: Constraint Satisfaction; Knowledge Representation and Reasoning; Knowledge-Based Systems

In Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART, 1179-1188, 2024 , Rome, Italy

Authors: Tomasz Jastrząb ¹ ; Frédéric Lardeux ² and Éric Monfroy ²

Affiliations: ¹ Silesian University of Technology, Gliwice, Poland ; ² LERIA, University of Angers, Angers, France

Keyword(s): Grammatical Inference, Nondeterministic Automata, SAT Models.

Abstract: Grammatical inference consists in learning a language or a grammar from data. In this paper, we consider a number of models for inferring a non-deterministic finite automaton (NFA) with 3 sorts of states, that must accept some words, and reject some other words from a given sample. We then propose a transformation from this 3-sort NFA into weighted-frequency and probabilistic NFA, and we apply the latter to a classification task. The experimental evaluation of our approach shows that the probabilistic NFAs can be successfully applied for classification tasks on both real-life and superficial benchmark data sets.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 8.217.144.104

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Jastrząb, T., Lardeux, F. and Monfroy, É. (2024). Classifying Words with 3-sort Automata. In Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART; ISBN 978-989-758-680-4; ISSN 2184-433X, SciTePress, pages 1179-1188. DOI: 10.5220/0012454100003636

@conference{icaart24,
author={Tomasz Jastrząb and Frédéric Lardeux and Éric Monfroy},
title={Classifying Words with 3-sort Automata},
booktitle={Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART},
year={2024},
pages={1179-1188},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012454100003636},
isbn={978-989-758-680-4},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART
TI - Classifying Words with 3-sort Automata
SN - 978-989-758-680-4
IS - 2184-433X
AU - Jastrząb, T.
AU - Lardeux, F.
AU - Monfroy, É.
PY - 2024
SP - 1179
EP - 1188
DO - 10.5220/0012454100003636
PB - SciTePress