An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing

Noord, Gertjan van; Gerdemann, Dale

doi:10.1007/3-540-45526-4_12

Cited by 23 publications

(11 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These include INTEX [8]; FSM [9], which is a unix-based set of programs for manipulating automata and transducers; FSA Utilities [10], which is a freely available, Prolog implemented system; and XFST [5], which is a commercial package assumed to be the most suitable for linguistic applications by providing the most expressive language.…”

Section: Introductionmentioning

confidence: 99%

Finite-State Technology as a Programming Environment

Wintner

2007

Computational Linguistics and Intelligent Text Processing

View full text Add to dashboard Cite

Abstract. Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural language processing stems from four sources: modularity of the design, due to the closure properties of regular languages and relations; the compact representation that is achieved through minimization; efficiency, which is a result of linear recognition time with finite-state devices; and reversibility, resulting from the declarative nature of such devices.However, when wide-coverage grammars are considered, finite-state technology does not scale up well, and the benefits of this technology can be overshadowed by the limitations it imposes as a programming environment for language processing. This paper focuses on several aspects of large-scale grammar development. Using a real-world benchmark, we compare a finite-state implementation with an equivalent Java program with respect to ease of development, modularity, maintainability of the code and space and time efficiency. We identify two main problems, abstraction and incremental development, which are currently not addressed sufficiently well by finite-state technology, and which we believe should be the focus of future research and development.

show abstract

Section: Introductionmentioning

confidence: 99%

Finite-State Technology as a Programming Environment

Wintner

2007

Computational Linguistics and Intelligent Text Processing

View full text Add to dashboard Cite

show abstract

“…Researchers at AT&T led the way with their FSM Library [11] which represented weighted finite-state automata by incorporating the theory of semirings over rational power series cleanly into the existing automata theory. Other toolkits, such as van Noord's FSA utilities [12], the RWTH toolkit [13], and the USC/ISI Carmel toolkit [14], provided additional interfaces and utilities for working with weighted finite-state automata. As in the unweighted case, the availability of this software led to many research projects that took advantage of pre-existing implementations [15][16][17] and the development of the software led to the invention of new algorithms and theory [18,19].…”

Section: Introductionmentioning

confidence: 99%

Tiburon: A Weighted Tree Automata Toolkit

May

Knight

2006

Implementation and Application of Automata

View full text Add to dashboard Cite

Abstract. The availability of weighted finite-state string automata toolkits made possible great advances in natural language processing. However, recent advances in syntax-based NLP model design are unsuitable for these toolkits. To combat this problem, we introduce a weighted finite-state tree automata toolkit, which incorporates recent developments in weighted tree automata theory and is useful for natural language applications such as machine translation, sentence compression, question answering, and many more.

show abstract

“…Several toolboxes provide extended regular expression description languages and compilers of the expressions to finite state automata (FSAs) and transducers (FSTs) [3][4][5]. While FS approaches for natural languages processing have generally been very successful, it is widely recognized that they are less suitable for non-concatenative phenomena.…”

Section: Introductionmentioning

confidence: 99%

Finite-State Registered Automata and Their Uses in Natural Languages

Cohen-Sygal

Wintner

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expressions denote arbitrary FSRAs and use it to describe some morphological and phonological phenomena. We also define several dedicated operators which support an easy and efficient implementation of some non-trivial morphological phenomena. In addition, we extend FSRA to finite-state registered transducers and demonstrate their space efficiency.

show abstract

An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing

Cited by 23 publications

References 14 publications

Finite-State Technology as a Programming Environment

Finite-State Technology as a Programming Environment

Tiburon: A Weighted Tree Automata Toolkit

Finite-State Registered Automata and Their Uses in Natural Languages

Contact Info

Product

Resources

About