Aarne Ranta  Home/Search
Context Related
| cs.chalmers.se/~aarn...ankara1998.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.chalmers.se/~aa...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This report explains a natural-language interface to the formalism of XFST (Xerox Finite State Tool), which is a rich language used for specifying finite state automata and transducers. By using the interface, it is possible to give input to XFST in English and French, as well as to translate formal XFST code into these languages. It is also possible to edit XFST source files and their natural-language equivalents interactively, in parallel. (Update)
Similar documents based on text: More All
2.5: A Multilingual Natural-Language Interface to Regular Expressions - Ranta (1998) (Correct)
0.4: Towards a Finite-State Parser for Swedish - Megyesi, Rydin (2000) (Correct)
0.3: Revised Version - Aarne Ranta Xerox (Correct)
BibTeX entry: (Update)
Aarne Ranta. A multilingual natural lan- guage interface to regular expressions. In Lauri Karttunen and Kemal Oflazer, editors, Proceedings o! International Workshop on Finite State Methods in Natural Language Processing, FSMNLP'98, 1998. http://citeseer.ist.psu.edu/article/ranta98multilingual.html More
@incollection{ ranta98multilingual,
author = "Aarne Ranta",
title = "A Multilingual Natural Language Interface to Regular Expressions",
booktitle = "{FSMNLP'98}: International Workshop on Finite State Methods in Natural Language Processing",
publisher = "Association for Computational Linguistics",
address = "Somerset, New Jersey",
editor = "Lauri Karttunen",
pages = "79--90",
year = "1998",
url = "citeseer.ist.psu.edu/article/ranta98multilingual.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
105 Regular Models of Phonological Rule Systems (context) - Kaplan, Kay - 1994
65 How to replace failure by a list of successes (context) - Wadler - 1985
65 Report on the Programming Language Haskell (context) - Peterson, eds - 1997
36 Extracting text from proofs - Coscoy, Kahn et al. - 1995
27 Formal Philosophy (context) - Montague - 1974
21 Directed Replacement - Karttunen - 1996
7 Context-relative syntactic categories and the formalization .. (context) - Ranta - 1996
2 A natural-language interface to regular expressions (context) - Kinnunen - 1997
2 Structures grammaticales dans le francais math'ematique (context) - Ranta - 1997
2 Examples of Networks and Regular Expressions (context) - Karttunen - 1997
2 Syntax and Semantics of Regular Expressions (context) - Karttunen - 1997
Documents on the same site (http://www.cs.chalmers.se/~aarne/./doc/publications.html): More
Formal Verification of Multilingual Instructions - Kristofer Johannisson And (Correct)
Type Theory and the Informal Language of Mathematics - Ranta (Correct)
The type theory and type checker of GF - Petri Maenpaa Aarne (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC