An experimental Tagalog Finite State Automata spellchecker with Levenshtein edit-distance feature
© 2019 IEEE. In this paper, we present an experimental development of a spell checker for the Tagalog language using a set of word list with 300 random root words and three inflected forms as training data and a two-layered architecture of combined Deterministic Finite Automaton (DFA) with Levenshte...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2019
|
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/871 https://animorepository.dlsu.edu.ph/context/faculty_research/article/1870/type/native/viewcontent |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |