Results 1  10
of
2,691,810
Finitestate technology as a programming environment
 Proceedings of the Conference on Computational Linguistics and Intelligent Text Processing (CICLing2007), volume 4394 of Lecture Notes in Computer Science
, 2007
"... Abstract. Finitestate 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 la ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abstract. Finitestate 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
FiniteState Technology in Natural Language Processing
"... Finitestate technology is at the core of many standard approaches in natural language processing [1, 2]. However, the terminology and the notations differ significantly between theoretical computer science (TCS) [3] and natural language processing (NLP) [4]. In this lecture, inspired by [2, 4], we ..."
Abstract
 Add to MetaCart
Finitestate technology is at the core of many standard approaches in natural language processing [1, 2]. However, the terminology and the notations differ significantly between theoretical computer science (TCS) [3] and natural language processing (NLP) [4]. In this lecture, inspired by [2, 4
Integrating finitestate technology with deep LFG grammars
 In Proceedings of the ESSLLI’04 Workshop on Combining Shallow and Deep Processing for NLP
, 2004
"... Researchers at PARC were pioneers in developing finitestate methods for applications in computational linguistics, and one of the original motivations was to provide a coherent architecture for the integration of lowerlevel lexical processing with higherlevel syntactic analysis (Kaplan and Kay, 1 ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
Researchers at PARC were pioneers in developing finitestate methods for applications in computational linguistics, and one of the original motivations was to provide a coherent architecture for the integration of lowerlevel lexical processing with higherlevel syntactic analysis (Kaplan and Kay
Neural Associative Memory with Finite State Technology
"... Morphological learning approaches have been successfully applied to morphological tasks in computational linguistics including morphological analysis and generation. We take a new look at the fundamental properties of associative memory along with the power of turing machine and show how it can be a ..."
Abstract
 Add to MetaCart
Morphological learning approaches have been successfully applied to morphological tasks in computational linguistics including morphological analysis and generation. We take a new look at the fundamental properties of associative memory along with the power of turing machine and show how it can be adopted for natural language processing. The ability to store and recall stored patterns based on associations make these memories so potentially valuable for natural language processing. A neural associative memory recollects word pattern based on an input that resembles the input word pattern, which is sufficient to retrieve the complete pattern. Morphological parser and Turing lexicon are used to process regular inflectional morphology. The rules of unrestricted grammar are extracted from the morphological parser. Turing Lexicon processes input word using the unrestricted grammar. The associative learning algorithm is a classification method based on Euclidean minimum distance for stem or attribute. The stems and attributes are indexed in the associated memory for quick retrieval. The associative memory is used to recall correct and incorrect word patterns. A machine is designed to implement the morphological process as a special case by achieving both concatenative and nonconcatenative phenomena of natural languages. The experimental results shows that the proposed approach has attained good performance in terms of speed and efficiency.
Using Finite State Technology in Natural Language Processing of Basque
"... Abstract. This paper describes the components used in the design and implementation of NLP tools for Basque. These components are based on finite state technology and are devoted to the morphological analysis of Basque, an agglutinative preIndoEuropean language. We think that our design can be int ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract. This paper describes the components used in the design and implementation of NLP tools for Basque. These components are based on finite state technology and are devoted to the morphological analysis of Basque, an agglutinative preIndoEuropean language. We think that our design can
Squeezing the Infinite into the Finite: Handling the OT Candidate Set with Finite State Technology
"... Abstract. Finite State approaches to Optimality Theory have had two goals. The earlier and less ambitious one was to compute the optimal output by compiling a finite state automaton for each underlying representation. Newer approaches aimed at realizing the OTsystems as FS transducers mapping any u ..."
Abstract
 Add to MetaCart
Abstract. Finite State approaches to Optimality Theory have had two goals. The earlier and less ambitious one was to compute the optimal output by compiling a finite state automaton for each underlying representation. Newer approaches aimed at realizing the OTsystems as FS transducers mapping any
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1387 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 653 (33 self)
 Add to MetaCart
Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a
Finite state Markovchain approximations to univariate and vector autoregressions
 Economics Letters
, 1986
"... The paper develops a procedure for finding a discretevalued Markov chain whose sample paths approximate well those of a vector autoregression. The procedure has applications in those areas of economics, finance, and econometrics where approximate solutions to integral equations are required. 1. ..."
Abstract

Cited by 492 (0 self)
 Add to MetaCart
The paper develops a procedure for finding a discretevalued Markov chain whose sample paths approximate well those of a vector autoregression. The procedure has applications in those areas of economics, finance, and econometrics where approximate solutions to integral equations are required. 1.
A ComputerAssisted Translation Tool based on FiniteState Technology ∗
"... The ComputerAssisted Translation (CAT) paradigm tries to integrate human expertise into the automatic translation process. In this paradigm, ..."
Abstract
 Add to MetaCart
The ComputerAssisted Translation (CAT) paradigm tries to integrate human expertise into the automatic translation process. In this paradigm,
Results 1  10
of
2,691,810