• No results found

Finite-State Transducers

Neural Grammatical Error Correction with Finite State Transducers

Neural Grammatical Error Correction with Finite State Transducers

... Grammatical error correction (GEC) is one of the areas in natural language processing in which purely neural models have not yet su- perseded more traditional symbolic models. Hybrid systems combining phrase-based sta- ...

7

Hindi Urdu Machine Transliteration using Finite State Transducers

Hindi Urdu Machine Transliteration using Finite State Transducers

... of finite-state ...the finite-state transducer (Mohri, 1997) has significantly reduced the amount of efforts to build the HUMT ...of finite-state transducers, they can be ...

8

Processing Mutations in Breton with Finite State Transducers

Processing Mutations in Breton with Finite State Transducers

... One characteristic feature of Celtic languages is mutation, i.e. the fact that the initial consonant of words may change according to the context. We provide a quick description of this linguistic phenomenon for Breton ...

5

Locating noun phrases with finite state transducers

Locating noun phrases with finite state transducers

... Locating noun phrases with finite state transducers L o c a t i n g n o u n p h r a s e s w i t h finite s t a t e t r a n s d u c e r s J e a n S e n e l l a r t L A D L ( L a b o r a t o i r e d ' a[.] ...

8

Using Finite State Transducers for Helping Foreign Language Learning

Using Finite State Transducers for Helping Foreign Language Learning

... Finite state technology is proven to increase the ef- ficiency in many rule-based NLP related tasks (Mohri, 1997; Roche and Schabes, ...of finite state transducer (FST) frameworks such as ...

5

Two Parsing Algorithms by Means of Finite State Transducers

Two Parsing Algorithms by Means of Finite State Transducers

... Two Parsing Algorithms by Means of Finite State Transducers T w o P a r s i n g A l g o r i t h m s by M e a n s of F i n i t e S t a t e T r a n s d u c e r s E m m a i m e l R e c h e * M i t s u b[.] ...

5

Avyaya Analyzer: Analysis of Indeclinables using Finite State Transducers

Avyaya Analyzer: Analysis of Indeclinables using Finite State Transducers

... It can be checked whether the word is avyaya or not by noticing whether the word is nipāta or by comprehending its suffix. If the word is nipāta, then treat it as avyaya and stop. If the word ends with the suffix related ...

5

Modeling Reduplication with 2 way Finite State Transducers

Modeling Reduplication with 2 way Finite State Transducers

... within finite-state treat- ments of morphology. Most finite-state im- plementations of computational morphology cannot adequately capture the productivity of unbounded copying in ...

12

Composing Finite State Transducers on GPUs

Composing Finite State Transducers on GPUs

... Weighted finite state transducers (FSTs) are frequently used in language process- ing to handle tasks such as part-of-speech tagging and speech ...accelerate finite state algorithms, ...

9

Building a Syllabic Analyzer for Persian Using Finite State Transducers

Building a Syllabic Analyzer for Persian Using Finite State Transducers

... (1994), finite state technology is deemed suitable for describing the morphological phenomena among concatenative ...into finite state automata (FSA) and finite state ...

12

Intrasentential Grammatical Correction with Weighted Finite State Transducers.

Intrasentential Grammatical Correction with Weighted Finite State Transducers.

... Finite state transducers have applications in several problem ...Several finite state transducer implementations currently exist, such as Juicer targeted toward ASR implementations ...

113

Hierarchical Phrase Based Translation with Weighted Finite State Transducers

Hierarchical Phrase Based Translation with Weighted Finite State Transducers

... Hierarchical phrase-based translation generates translation hypotheses via the application of hierar- chical rules in CYK parsing (Chiang, 2005). Cube pruning is used to apply language models at each cell of the CYK grid ...

9

Neural Finite State Transducers: Beyond Rational Relations

Neural Finite State Transducers: Beyond Rational Relations

... neural finite state transducers (NFSTs), a family of string transduction models defining joint and conditional probability distri- butions over pairs of ...a finite state ...previous ...

12

Bayesian Inference for Finite State Transducers

Bayesian Inference for Finite State Transducers

... We describe a Bayesian inference algorithm that can be used to train any cascade of weighted finite-state transducers on end-to- end data. We also investigate the problem of automatically selecting ...

9

Linear Transduction Grammars and Zipper Finite-State Transducers

Linear Transduction Grammars and Zipper Finite-State Transducers

... to finite-state ...four finite-state languages to each ...zipper finite-state automata ( ZFSA s) and zipper finite-state transducers ( ZFST s) in order to ...

8

Machine Translation with Inferred Stochastic Finite State Transducers

Machine Translation with Inferred Stochastic Finite State Transducers

... Finite-state transducers are models that are being used in different areas of pattern recognition and computational ...attractive. Finite-state transducers are very adequate for ...

21

Parallel Intersection and Serial Composition of Finite State Transducers

Parallel Intersection and Serial Composition of Finite State Transducers

... Parallel Intersection and Serial Composition of Finite State Transducers P a r a l l e l I n t e r s e c t i o n a n d S e r i a l C o m p o s i t i o n o f F i n i t e S t a t e T r a n s d u c e r s[.] ...

5

Using Finite State Transducers for Making Efficient Reading Comprehension Dictionaries

Using Finite State Transducers for Making Efficient Reading Comprehension Dictionaries

... combining finite-state transducers (FSTs) with electronic dictionaries, thereby creating efficient reading comprehension ...The finite state transducer analyses the word to be looked ...

13

Urdu   Roman Transliteration via Finite State Transducers

Urdu Roman Transliteration via Finite State Transducers

... probabilistic finite state transducer that solves the encountered scriptural issues via a partic- ular architectural design in combination with a set of ...

5

Automatic Sanskrit Segmentizer Using Finite State Transducers

Automatic Sanskrit Segmentizer Using Finite State Transducers

... Sanskrit words are mostly analyzed by build- ing a finite state transducer (Beesley, 1998). In the first approach, this transducer was modified by linking the final states to appropriate interme- diate ...

6

Show all 10000 documents...

Related subjects