<--- Back to Details
First PageDocument Content
Models of computation / Computer science / Applied mathematics / Finite state transducer / Regular language / Nondeterministic finite automaton / Finite-state machine / N-gram / Probabilistic automaton / Automata theory / Formal languages / Theoretical computer science
Date: 2006-03-24 09:49:11
Models of computation
Computer science
Applied mathematics
Finite state transducer
Regular language
Nondeterministic finite automaton
Finite-state machine
N-gram
Probabilistic automaton
Automata theory
Formal languages
Theoretical computer science

Weighted Rational Transductions and their Application to Human Language Processing

Add to Reading List

Source URL: www.cs.mun.ca

Download Document from Source Website

File Size: 669,75 KB

Share Document on Facebook

Similar Documents

National School SIDRA 2017: Formal Methods for the Control of Large-scale Networked Nonlinear Systems with Logic Specifications Lecture L4: Regular languages?

DocID: 1v5XV - View Document

CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2010 Lecture 15 Andrej Bogdanov

DocID: 1uDy7 - View Document

Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtrackingāˆ— Roman R. Redziejowski Abstract Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG)

DocID: 1tWkC - View Document

Formal Verification of Code Generators for Modeling Languages (Invited Talk) Xavier Leroy Inria, Paris, France

DocID: 1tNbI - View Document

A Case for Combining Industrial Pragmatics with Formal Methods Eric L. McCorkle I. BACKGROUND A. Dependent Types Dependently-typed languages [9] possess a type system with

DocID: 1tbAh - View Document