A Programming Language for Finite State Transducers

A Programming Language for Finite State Transducers

SFST-PL is a programming language for finite-state transducers which is based on extended regular expressions with variables. SFST-PL is used by the Stuttgart Finite-State-Transducer (SFST) tools which are available under the GNU public license. SFST-PL was designed as a general programming language...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Schmid, Helmut
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Exact sciences and technology
Speech and sound recognition and synthesis. Linguistics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 309
container_issue
container_start_page 308
container_title
container_volume
creator Schmid, Helmut
description SFST-PL is a programming language for finite-state transducers which is based on extended regular expressions with variables. SFST-PL is used by the Stuttgart Finite-State-Transducer (SFST) tools which are available under the GNU public license. SFST-PL was designed as a general programming language for the development of tokenizers, pattern recognizers, computational morphologies and other FST applications. The first SFST application was the SMOR morphology [1], a large-scale German morphology which covers composition, derivation and inflection. An SFST program consists of a list of variable and alphabet assignments followed by a single regular expression which defines the resulting transducer.
doi_str_mv 10.1007/11780885_38
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19162350</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19162350</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-fe8e94b3300603892e999f98aaf16ccb1c98aadf140c3fb54829cf7d0896784b3</originalsourceid><addsrcrecordid>eNpNUE1LAzEQjV9grT35B_biwcPqzM7uJnMsxapQULCeQzZNltV2tyTtwX9vShUcmHkD783weELcINwjgHxAlAqUqjSpEzFhqagqIXXN8lSMsEbMiUo-E1d_hIRzMQKCImdZ0qWYxPgJqQhlXcmRoGn2FoY2mM2m69tsYfp2b1qX-SFk867vdi5735k0l8H0cbW3LsRrceHNOrrJL47Fx_xxOXvOF69PL7PpIt8WyLvcO-W4bIgAaiDFhWNmz8oYj7W1DdrDvvJYgiXfVKUq2Hq5AsW1VOlwLG6Pf7cmWrP2yYHtot6GbmPCt0bGuqAKku7uqIuJ6lsXdDMMX1Ej6ENq-l9q9APZCFgw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Programming Language for Finite State Transducers</title><source>Springer Books</source><creator>Schmid, Helmut</creator><contributor>Karttunen, Lauri ; Karhumäki, Juhani ; Yli-Jyrä, Anssi</contributor><creatorcontrib>Schmid, Helmut ; Karttunen, Lauri ; Karhumäki, Juhani ; Yli-Jyrä, Anssi</creatorcontrib><description>SFST-PL is a programming language for finite-state transducers which is based on extended regular expressions with variables. SFST-PL is used by the Stuttgart Finite-State-Transducer (SFST) tools which are available under the GNU public license. SFST-PL was designed as a general programming language for the development of tokenizers, pattern recognizers, computational morphologies and other FST applications. The first SFST application was the SMOR morphology [1], a large-scale German morphology which covers composition, derivation and inflection. An SFST program consists of a list of variable and alphabet assignments followed by a single regular expression which defines the resulting transducer.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540354670</identifier><identifier>ISBN: 9783540354673</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540354697</identifier><identifier>EISBN: 3540354697</identifier><identifier>DOI: 10.1007/11780885_38</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Computer science; control theory; systems ; Exact sciences and technology ; Speech and sound recognition and synthesis. Linguistics</subject><ispartof>Finite-State Methods and Natural Language Processing, 2006, p.308-309</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11780885_38$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11780885_38$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4035,4036,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=19162350$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Karttunen, Lauri</contributor><contributor>Karhumäki, Juhani</contributor><contributor>Yli-Jyrä, Anssi</contributor><creatorcontrib>Schmid, Helmut</creatorcontrib><title>A Programming Language for Finite State Transducers</title><title>Finite-State Methods and Natural Language Processing</title><description>SFST-PL is a programming language for finite-state transducers which is based on extended regular expressions with variables. SFST-PL is used by the Stuttgart Finite-State-Transducer (SFST) tools which are available under the GNU public license. SFST-PL was designed as a general programming language for the development of tokenizers, pattern recognizers, computational morphologies and other FST applications. The first SFST application was the SMOR morphology [1], a large-scale German morphology which covers composition, derivation and inflection. An SFST program consists of a list of variable and alphabet assignments followed by a single regular expression which defines the resulting transducer.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Speech and sound recognition and synthesis. Linguistics</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540354670</isbn><isbn>9783540354673</isbn><isbn>9783540354697</isbn><isbn>3540354697</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNUE1LAzEQjV9grT35B_biwcPqzM7uJnMsxapQULCeQzZNltV2tyTtwX9vShUcmHkD783weELcINwjgHxAlAqUqjSpEzFhqagqIXXN8lSMsEbMiUo-E1d_hIRzMQKCImdZ0qWYxPgJqQhlXcmRoGn2FoY2mM2m69tsYfp2b1qX-SFk867vdi5735k0l8H0cbW3LsRrceHNOrrJL47Fx_xxOXvOF69PL7PpIt8WyLvcO-W4bIgAaiDFhWNmz8oYj7W1DdrDvvJYgiXfVKUq2Hq5AsW1VOlwLG6Pf7cmWrP2yYHtot6GbmPCt0bGuqAKku7uqIuJ6lsXdDMMX1Ej6ENq-l9q9APZCFgw</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Schmid, Helmut</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>A Programming Language for Finite State Transducers</title><author>Schmid, Helmut</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-fe8e94b3300603892e999f98aaf16ccb1c98aadf140c3fb54829cf7d0896784b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Speech and sound recognition and synthesis. Linguistics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Schmid, Helmut</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Schmid, Helmut</au><au>Karttunen, Lauri</au><au>Karhumäki, Juhani</au><au>Yli-Jyrä, Anssi</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Programming Language for Finite State Transducers</atitle><btitle>Finite-State Methods and Natural Language Processing</btitle><date>2006</date><risdate>2006</risdate><spage>308</spage><epage>309</epage><pages>308-309</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540354670</isbn><isbn>9783540354673</isbn><eisbn>9783540354697</eisbn><eisbn>3540354697</eisbn><abstract>SFST-PL is a programming language for finite-state transducers which is based on extended regular expressions with variables. SFST-PL is used by the Stuttgart Finite-State-Transducer (SFST) tools which are available under the GNU public license. SFST-PL was designed as a general programming language for the development of tokenizers, pattern recognizers, computational morphologies and other FST applications. The first SFST application was the SMOR morphology [1], a large-scale German morphology which covers composition, derivation and inflection. An SFST program consists of a list of variable and alphabet assignments followed by a single regular expression which defines the resulting transducer.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11780885_38</doi><tpages>2</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Finite-State Methods and Natural Language Processing, 2006, p.308-309
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_19162350
source Springer Books
subjects Applied sciences
Artificial intelligence
Computer science
control theory
systems
Exact sciences and technology
Speech and sound recognition and synthesis. Linguistics
title A Programming Language for Finite State Transducers
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T23%3A36%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Programming%20Language%20for%20Finite%20State%20Transducers&rft.btitle=Finite-State%20Methods%20and%20Natural%20Language%20Processing&rft.au=Schmid,%20Helmut&rft.date=2006&rft.spage=308&rft.epage=309&rft.pages=308-309&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540354670&rft.isbn_list=9783540354673&rft_id=info:doi/10.1007/11780885_38&rft_dat=%3Cpascalfrancis_sprin%3E19162350%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540354697&rft.eisbn_list=3540354697&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true