Abstract
We describe new applications of the theory of automata to natural
language processing: the representation of very large scale dictionaries
and the indexation of natural language texts. They are based on new algorithms
that we introduce and describe in detail. In particular, we give pseudocodes
for the determinisation of string to string transducers, the deterministic
union of p-subsequential string to string transducers, and the
indexation by automata. We report on several experiments illustrating the
applications.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Linguistics and Language,Language and Linguistics,Software
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Population-Based Algorithms Built on Weighted Automata;Lecture Notes in Computer Science;2024
2. Rules with Additive Invariants;Understanding Complex Systems;2023
3. Data Transformation Acceleration using Deterministic Finite-State Transducers;2022 IEEE International Conference on Big Data (Big Data);2022-12-17
4. Subregular linguistics: bridging theoretical linguistics and formal grammar;Theoretical Linguistics;2022-10-01
5. Ferrofluid Droplet Robot Manipulation Using Rule-Based Control Strategy;2022 IEEE XVIII International Conference on the Perspective Technologies and Methods in MEMS Design (MEMSTECH);2022-09-07