On some applications of finite-state automata theory to natural language processing

Mehryar Mohri

doi:10.1017/S135132499600126X

On some applications of finite-state automata theory to natural language processing

Mehryar Mohri

Computer Science

Research output: Contribution to journal › Article › peer-review

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 determination 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.

Original language	English (US)
Pages (from-to)	61-80
Number of pages	20
Journal	Natural Language Engineering
Volume	2
Issue number	pt 1
DOIs	https://doi.org/10.1017/S135132499600126X
State	Published - Mar 1996

ASJC Scopus subject areas

Software
Language and Linguistics
Linguistics and Language
Artificial Intelligence

Access to Document

10.1017/S135132499600126X

Cite this

@article{40ce14fa93004ab5a6cd5a9b697b38f5,

title = "On some applications of finite-state automata theory to natural language processing",

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 determination 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.",

author = "Mehryar Mohri",

year = "1996",

month = mar,

doi = "10.1017/S135132499600126X",

language = "English (US)",

volume = "2",

pages = "61--80",

journal = "Natural Language Engineering",

issn = "1351-3249",

publisher = "Cambridge University Press",

number = "pt 1",

}

TY - JOUR

T1 - On some applications of finite-state automata theory to natural language processing

AU - Mohri, Mehryar

PY - 1996/3

Y1 - 1996/3

N2 - 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 determination 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.

AB - 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 determination 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.

UR - http://www.scopus.com/inward/record.url?scp=0030092596&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030092596&partnerID=8YFLogxK

U2 - 10.1017/S135132499600126X

DO - 10.1017/S135132499600126X

M3 - Article

AN - SCOPUS:0030092596

SN - 1351-3249

VL - 2

SP - 61

EP - 80

JO - Natural Language Engineering

JF - Natural Language Engineering

IS - pt 1

ER -

On some applications of finite-state automata theory to natural language processing

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this