Difference: HfstPublications (1 vs. 26)

Revision 262016-05-22 - KristerLinden

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 6 to 6
 

HFST Publications

Changed:
<
<
It may also be possible to find the relevant publications in the PURE database of University of Helsinki under HFST
>
>
On the current GitHub repository, you can find more recent publications. It may also be possible to find the relevant publications in the TUHAT database of University of Helsinki under HFST
 

2012

Revision 252016-05-18 - KristerLinden

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 84 to 84
 -- KristerLinden - 27 May 2008, AnssiYliJyra - 07 Aug 2008

META TOPICMOVED by="KristerLinden" date="1212070782" from="KitWiki.HFSTPublications" to="KitWiki.HfstPublications"
Added:
>
>
META PREFERENCE name="VIEW_TEMPLATE" title="VIEW_TEMPLATE" type="Set" value="FinCLARIN.ViewFinClarinWideEngTemplate"

Revision 242012-07-31 - TommiPirinen

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 6 to 6
 

HFST Publications

Added:
>
>
It may also be possible to find the relevant publications in the PURE database of University of Helsinki under HFST

2012

  1. Tommi A Pirinen, Sam Hardwick (to appear, 2012d) Effect of Language and Error Models on Efficiency of Finite-State Spell-Checking and Correction, in Finite-State Methods and/in Natural Language Processing FSMNLP 2012
  2. Krister Lindén, Miikka Silfverberg, Erik Axelson, Senka Drobac, Sam Hardwick, Tommi A Pirinen (to appear, 2012c) Using HFST for creating Computational Linguistic Applications in Computational Linguistics-Applications 2012
  3. Tommi A Pirinen, Francis M. Tyers (2012b) Compiling Apertium morphological dictionaries with HFST and using them in HFST applications in Proceedings of Workshops in Language Resources and Evaluation conference LREC 2012, in saltmil-aflat workshop on “language technology for normalisation of less-resourced languages&#8221
  4. Tommi A Pirinen, Miikka Silfverberg (2012a) Improving Finite-State Spell-Checker Suggestions with Part-of-Speech N-grams in Proceedings of International Conference on Intelligent Text Processing and Computational Linguistics CICLING 2012
 

2011

  1. Lindén, K., Silfverberg, M., Axelson, E., Hardwick, S., Pirinen, T.A., HFST—Framework for Compiling and Applying Morphologies in Systems and Frameworks for Computational Morphology 2011, in Communications in Computer and Information Science (100), ISBN: 978-3-642-23138-4

Revision 232012-04-12 - ErikAxelson

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 70 to 70
 
Added:
>
>
  -- KristerLinden - 27 May 2008, AnssiYliJyra - 07 Aug 2008

Revision 222011-11-18 - TommiPirinen

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 6 to 6
 

HFST Publications

Added:
>
>

2011

  1. Lindén, K., Silfverberg, M., Axelson, E., Hardwick, S., Pirinen, T.A., HFST—Framework for Compiling and Applying Morphologies in Systems and Frameworks for Computational Morphology 2011, in Communications in Computer and Information Science (100), ISBN: 978-3-642-23138-4
  2. Silfverberg, M., Hyvärinen, M., Pirinen, T. A. (2011b), Improving Predictive Entry of Finnish Text Messages using IRC Logs in Proceedings of the Computational Linguistics-Applications Conference 2011, ISBN: 978-83-60810-47-7.
 

2010

Revision 212010-06-15 - AnssiYliJyra

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 9 to 9
 

2010

Added:
>
>
  • Yli-Jyrä, A. (2010). Conversions between crisply bipartite and unambiguous automata. In M. Droste, et al. (eds.), Weighted Automata: Theory and Applications, Leipzig, May 3 — 7, 2010. Institut für Informatik, Universität Leipzig.
 

2009

  • Hulden, M. (2009k). Parsing CFGs and PCFGs with a Chomsky-Schützenberger representation. LTC 2009.

Revision 202010-06-01 - KristerLinden

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 6 to 6
 

HFST Publications

Added:
>
>

2010

 

2009

Revision 192009-10-22 - AnssiYliJyra

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 18 to 18
 
Added:
>
>
 

2005-2008

  • Koskenniemi, K., Yli-Jyrä, A. (2008). CLARIN and Free Open Source Finite-State Tools. In Proceedings of FSMNLP 2008, Ispra, Italy.
  • Lindén, K. (2008b) A Probabilistic Model for Guessing Base Forms of New Words by Analogy. CICling-2008,9th International Conference on Intelligent Text Processing and Computational Linguistics, February 17 to 23, 2008, Haifa, Israel

Revision 182009-10-20 - KristerLinden

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 6 to 6
 

HFST Publications

Added:
>
>

2009

 
Line: 15 to 18
 
Added:
>
>

2005-2008

 
Changed:
<
<
>
>
 

Revision 172009-10-20 - KristerLinden

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Changed:
<
<

HFST Articles

>
>

HFST Publications

 
Line: 13 to 13
 
Changed:
<
<
  • Lindén, K. (2009b). Entry Generation for New Words by Analogy for Morphological Lexicons. In NEJLT - Northern European Journal of Language Technology. (in press)
>
>
 
  • Lindén, K. (2009a). Guessers for Finite-State Transducer Lexicons. In CICling-2009, 10th International Conference on Intelligent Text Processing and Computational Linguistics, March 1 to 7, 2009, Mexico City, Mexico
  • Koskenniemi, K., Yli-Jyrä, A. (2008). CLARIN and Free Open Source Finite-State Tools. In Proceedings of FSMNLP 2008, Ispra, Italy.
  • Lindén, K. (2008b) A Probabilistic Model for Guessing Base Forms of New Words by Analogy. CICling-2008,9th International Conference on Intelligent Text Processing and Computational Linguistics, February 17 to 23, 2008, Haifa, Israel

Revision 162009-10-16 - KristerLinden

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 17 to 17
 
  • Lindén, K. (2009a). Guessers for Finite-State Transducer Lexicons. In CICling-2009, 10th International Conference on Intelligent Text Processing and Computational Linguistics, March 1 to 7, 2009, Mexico City, Mexico
  • Koskenniemi, K., Yli-Jyrä, A. (2008). CLARIN and Free Open Source Finite-State Tools. In Proceedings of FSMNLP 2008, Ispra, Italy.
  • Lindén, K. (2008b) A Probabilistic Model for Guessing Base Forms of New Words by Analogy. CICling-2008,9th International Conference on Intelligent Text Processing and Computational Linguistics, February 17 to 23, 2008, Haifa, Israel
Changed:
<
<
>
>
 

Revision 152009-10-05 - ErikAxelson

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"
Changed:
<
<

HFST: Publications and Joint Publications with Other Research Groups

>
>

HFST: Publications

 

HFST Articles

Changed:
<
<
  • Silfverberg, M. and Lindén, K. (2009i). HFST Runtime Format - A Compacted Transducer Format Allowing for Fast Lookup. (submitted)
  • Lindén, K. and Pirinen, T. (2009h). Weighting Finite-State Morphological Analyzers using HFST tools. (submitted)
  • Lindén, K., Silfverberg, M. and Pirinen, T. (2009g). HFST Tools for Morphology - An Efficient Open-Source Package for Construction of Morphological Analyzers. In Proceedings of the Workshop on Systems and Frameworks for Computational Morphology 2009. September 2009, Zürich, Switzerland.
  • Lindén, K. and Tuovila, J. (2009f). Corpus-based Lexeme Ranking for Morphological Guessers. In Proceedings of the Workshop on Systems and Frameworks for Computational Morphology 2009. September 2009, Zürich, Switzerland.
>
>
 
Line: 16 to 17
 
  • Lindén, K. (2009a). Guessers for Finite-State Transducer Lexicons. In CICling-2009, 10th International Conference on Intelligent Text Processing and Computational Linguistics, March 1 to 7, 2009, Mexico City, Mexico
  • Koskenniemi, K., Yli-Jyrä, A. (2008). CLARIN and Free Open Source Finite-State Tools. In Proceedings of FSMNLP 2008, Ispra, Italy.
  • Lindén, K. (2008b) A Probabilistic Model for Guessing Base Forms of New Words by Analogy. CICling-2008,9th International Conference on Intelligent Text Processing and Computational Linguistics, February 17 to 23, 2008, Haifa, Israel
Changed:
<
<
>
>
 
Changed:
<
<
>
>
 

HFST Presentations

Revision 142009-05-25 - KristerLinden

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications and Joint Publications with Other Research Groups

Line: 7 to 7
 

HFST Articles

  • Silfverberg, M. and Lindén, K. (2009i). HFST Runtime Format - A Compacted Transducer Format Allowing for Fast Lookup. (submitted)
  • Lindén, K. and Pirinen, T. (2009h). Weighting Finite-State Morphological Analyzers using HFST tools. (submitted)
Changed:
<
<
  • Lindén, K., Silfverberg, M. and Pirinen, T. (2009g). HFST Tools for Morphology - An Efficient Open-Source Package for Construction of Morphological Analyzers. In Proceedings of the Workshop on Systems and Frameworks for Computational Morphology 2009. September 2009, Zürich, Switzerland.
  • Lindén, K., Tuovila, J. (2009f). Corpus-based Lexeme Ranking for Morphological Guessers. In Proceedings of the Workshop on Systems and Frameworks for Computational Morphology 2009. September 2009, Zürich, Switzerland.
  • Lindén, K. and Tuovila, J. (2009e). Corpus-based Paradigm Selection for Morphological Entries. In Proceedings of NODALIDA 2009, May 2009, Odense, Denmark
  • Lindén, K. and Pirinen, T. (2009d). [[http://www.ling.helsinki.fi/~klinden/pubs/linden09dnodalida.pdf][Weighted Finite-State Morphological Analysis of Finnish Compounds.] In Proceedings of NODALIDA 2009, May 2009, Odense, Denmark
  • Silfverberg, M., and Lindén, K.(2009c). Conflict Resolution Using Weighted Rules in HFST-TwolC. In Proceedings of NODALIDA 2009, May 2009, Odense, Denmark
  • Lindén, K. (2009b). Entry Generation for New Words by Analogy for Morphological Lexicons. In NEJLT - Northern European Journal of Language Technology. (in press)
  • Lindén, K. (2009a). Guessers for Finite-State Transducer Lexicons. In CICling-2009, 10th International Conference on Intelligent Text Processing and Computational Linguistics, March 1 to 7, 2009, Mexico City, Mexico
  • Koskenniemi, K., Yli-Jyrä, A. (2008). CLARIN and Free Open Source Finite-State Tools. In the Proceedings of FSMNLP 2008, Ispra, Italy.
>
>
  • Lindén, K., Silfverberg, M. and Pirinen, T. (2009g). HFST Tools for Morphology - An Efficient Open-Source Package for Construction of Morphological Analyzers. In Proceedings of the Workshop on Systems and Frameworks for Computational Morphology 2009. September 2009, Zürich, Switzerland.
  • Lindén, K. and Tuovila, J. (2009f). Corpus-based Lexeme Ranking for Morphological Guessers. In Proceedings of the Workshop on Systems and Frameworks for Computational Morphology 2009. September 2009, Zürich, Switzerland.
  • Lindén, K. and Tuovila, J. (2009e). Corpus-based Paradigm Selection for Morphological Entries. In Proceedings of NODALIDA 2009, May 2009, Odense, Denmark
  • Lindén, K. and Pirinen, T. (2009d). Weighted Finite-State Morphological Analysis of Finnish Compounds. In Proceedings of NODALIDA 2009, May 2009, Odense, Denmark
  • Silfverberg, M., and Lindén, K.(2009c). Conflict Resolution Using Weighted Rules in HFST-TwolC. In Proceedings of NODALIDA 2009, May 2009, Odense, Denmark
  • Lindén, K. (2009b). Entry Generation for New Words by Analogy for Morphological Lexicons. In NEJLT - Northern European Journal of Language Technology. (in press)
  • Lindén, K. (2009a). Guessers for Finite-State Transducer Lexicons. In CICling-2009, 10th International Conference on Intelligent Text Processing and Computational Linguistics, March 1 to 7, 2009, Mexico City, Mexico
  • Koskenniemi, K., Yli-Jyrä, A. (2008). CLARIN and Free Open Source Finite-State Tools. In Proceedings of FSMNLP 2008, Ispra, Italy.
 
Line: 27 to 27
 
Changed:
<
<

Ideas for New Publications

(type: C=conference, J=journal, T=technical)

ranking target
type
topic main authors requirements result type

Further Research

>
>

Further Research Ideas

 
Line: 61 to 55
 
Changed:
<
<
-- KristerLinden - 27 May 2008 -- AnssiYliJyra - 07 Aug 2008
>
>
-- KristerLinden - 27 May 2008, AnssiYliJyra - 07 Aug 2008
 
META TOPICMOVED by="KristerLinden" date="1212070782" from="KitWiki.HFSTPublications" to="KitWiki.HfstPublications"

Revision 132009-05-22 - KristerLinden

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications and Joint Publications with Other Research Groups

HFST Articles

Added:
>
>
  • Silfverberg, M. and Lindén, K. (2009i). HFST Runtime Format - A Compacted Transducer Format Allowing for Fast Lookup. (submitted)
  • Lindén, K. and Pirinen, T. (2009h). Weighting Finite-State Morphological Analyzers using HFST tools. (submitted)
  • Lindén, K., Silfverberg, M. and Pirinen, T. (2009g). HFST Tools for Morphology - An Efficient Open-Source Package for Construction of Morphological Analyzers. In Proceedings of the Workshop on Systems and Frameworks for Computational Morphology 2009. September 2009, Zürich, Switzerland.
  • Lindén, K., Tuovila, J. (2009f). Corpus-based Lexeme Ranking for Morphological Guessers. In Proceedings of the Workshop on Systems and Frameworks for Computational Morphology 2009. September 2009, Zürich, Switzerland.
  • Lindén, K. and Tuovila, J. (2009e). Corpus-based Paradigm Selection for Morphological Entries. In Proceedings of NODALIDA 2009, May 2009, Odense, Denmark
  • Lindén, K. and Pirinen, T. (2009d). [[http://www.ling.helsinki.fi/~klinden/pubs/linden09dnodalida.pdf][Weighted Finite-State Morphological Analysis of Finnish Compounds.] In Proceedings of NODALIDA 2009, May 2009, Odense, Denmark
  • Silfverberg, M., and Lindén, K.(2009c). Conflict Resolution Using Weighted Rules in HFST-TwolC. In Proceedings of NODALIDA 2009, May 2009, Odense, Denmark
  • Lindén, K. (2009b). Entry Generation for New Words by Analogy for Morphological Lexicons. In NEJLT - Northern European Journal of Language Technology. (in press)
  • Lindén, K. (2009a). Guessers for Finite-State Transducer Lexicons. In CICling-2009, 10th International Conference on Intelligent Text Processing and Computational Linguistics, March 1 to 7, 2009, Mexico City, Mexico
 
Line: 23 to 32
 (type: C=conference, J=journal, T=technical)

ranking target
type
topic main authors requirements result type
Deleted:
<
<
  C Common API between Multiple FST Compilers and Grammar Compilers
yleiskatsaus, design ja vertailu vastaaviin OpenSource-softiin
OMorFiGroup    
  C Legacy Finite-State Morphology Tools using Easily Variable FOSS Implementation Packages
twolc-toteutukset, hfst-twolc, konfliktiresoluutio ja tehokkuus
OMorFiGroup    
  C Legacy Finite-State Morphology Tools using Easily Variable FOSS Implementation Packages
lexc-toteutukset, hfst-lexc, painolliset automaatit ja tehokkuus
OMorFiGroup    
  C Measuring the Performance of Open FST Class Libraries in Morphology
hfst API, sanakirjan kääntäminen ja tehokkuus SFST vs. OpenFST
OMorFiGroup    
  C sanakirjasovellus: analysaattori, generaattori ja arvaaja OMorFiGroup    
  T HFST 2.0 API + kirjasto (Sourceforge) + käyttöohjeet ja -esimerkit OMorFiGroup   hfst library
  T hfst-twolc (Sourceforge) + käyttöohjeet ja -esimerkit OMorFiGroup   a free TWOLC
  T hfst-lexc (Sourceforge) + käyttöohjeet ja -esimerkit OMorFiGroup   a free LEXC
  T tehokkuusvertailut: sfst vs. openfst, hfst vs. xerox OMorFiGroup   survey
  J Applications of Diamonded Double Negation AnssiYliJyra    
  J Compiling Parallel Replace Rules with Generalized Lenient Composition AnssiYliJyra  
 

Further Research

Added:
>
>
 

Revision 122008-11-24 - KristerLinden

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"
Changed:
<
<

HFST: HFST Publications and Joint Publications with Other Research Groups

>
>

HFST: Publications and Joint Publications with Other Research Groups

 

Revision 112008-10-29 - AnssiYliJyra

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: HFST Publications and Joint Publications with Other Research Groups

HFST Articles

Added:
>
>
  • Koskenniemi, K., Yli-Jyrä, A. (2008). CLARIN and Free Open Source Finite-State Tools. In the Proceedings of FSMNLP 2008, Ispra, Italy.
 
Changed:
<
<
>
>
 
Changed:
<
<
>
>
 

HFST Presentations

Revision 102008-08-20 - AnssiYliJyra

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: HFST Publications and Joint Publications with Other Research Groups

Line: 16 to 16
 

Ideas for New Publications

Changed:
<
<
>
>
(type: C=conference, J=journal, T=technical)

ranking target
type
topic main authors requirements result type
  C Common API between Multiple FST Compilers and Grammar Compilers
yleiskatsaus, design ja vertailu vastaaviin OpenSource-softiin
OMorFiGroup    
  C Legacy Finite-State Morphology Tools using Easily Variable FOSS Implementation Packages
twolc-toteutukset, hfst-twolc, konfliktiresoluutio ja tehokkuus
OMorFiGroup    
  C Legacy Finite-State Morphology Tools using Easily Variable FOSS Implementation Packages
lexc-toteutukset, hfst-lexc, painolliset automaatit ja tehokkuus
OMorFiGroup    
  C Measuring the Performance of Open FST Class Libraries in Morphology
hfst API, sanakirjan kääntäminen ja tehokkuus SFST vs. OpenFST
OMorFiGroup    
  C sanakirjasovellus: analysaattori, generaattori ja arvaaja OMorFiGroup    
  T HFST 2.0 API + kirjasto (Sourceforge) + käyttöohjeet ja -esimerkit OMorFiGroup   hfst library
  T hfst-twolc (Sourceforge) + käyttöohjeet ja -esimerkit OMorFiGroup   a free TWOLC
  T hfst-lexc (Sourceforge) + käyttöohjeet ja -esimerkit OMorFiGroup   a free LEXC
  T tehokkuusvertailut: sfst vs. openfst, hfst vs. xerox OMorFiGroup   survey
  J Applications of Diamonded Double Negation AnssiYliJyra    
  J Compiling Parallel Replace Rules with Generalized Lenient Composition AnssiYliJyra  
 

Further Research

Changed:
<
<
>
>
 
Added:
>
>
 

Revision 92008-08-20 - AnssiYliJyra

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"
Changed:
<
<

HFST: Publications

>
>

HFST: HFST Publications and Joint Publications with Other Research Groups

 
Changed:
<
<

Articles

>
>

HFST Articles

 
Changed:
<
<

Presentations

>
>

HFST Presentations

 
Line: 23 to 23
 
  • GR-publications (by AnssiYliJyra et al.)
    • Applications of Diamonded Double Negation - target: CL
    • Compiling Parallel Replace Rules with Generalized Lenient Composition - target: ??
Added:
>
>
  • Tokenizer-related publications (by the HunMorph group of BUTE and the OMorFi group)
    • HfstTokenizer: Iterated FST Tokenizer and Bottom-Up Parser for Precedence Grammars
    • Precedence Grammar Properties of Regular Expressions
    • A tokenizer for the needs of HunMorph
 

Further Research

Revision 82008-08-19 - AnssiYliJyra

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Added:
>
>
 

Articles

Line: 14 to 16
 

Ideas for New Publications

Changed:
<
<
  • HFST: a Common API between Multiple FST Compilers and Grammar Compilers
  • HFST-TWOLC: Measuring the Performance of Open FST Class Libraries in Rule Compilation and Application
  • HFST-LEXC and HFST-TWOLC: Tools for Open Morphology
>
>
 

Further Research

Changed:
<
<
>
>
 
    • HFST-TOKEN: A Compiler for Tokenizer Transducers
    • HFST-MORPH: Compiling the HunMorph Aff-Dic Descriptions into Transducers
    • Revising the Operation of Generalized Restriction
Line: 30 to 38
 
    • Weighted Generalized Restriction
    • Learning a Succinct Inverse of Generalized Restriction
    • Complete Conflict Resolution Scheme for Two-Level Morphology
Changed:
<
<
  • Simplified Multi-Tape Transducers for Layered Grammars
  • Cover Techniques for Automata Computations
  • HfstParallelProcessing
>
>
  • Cover Techniques for Automata Computations - target: CIAA
    • Simplified Multi-Tape Transducers and Cover Techniques for Layered Grammars
 

Revision 72008-08-18 - AnssiYliJyra

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 20 to 20
 

Further Research

Added:
>
>
 
  • HFST-TOKEN: A Compiler for Tokenizer Transducers
  • HFST-MORPH: Compiling the HunMorph Aff-Dic Descriptions into Transducers
  • Revising the Operation of Generalized Restriction
Changed:
<
<
  • Simplified Multi-Tape Transducers for Layered Grammars
>
>
    • An Encoding for Finite-State Dependency Grammars
 
  • Lexicalizing the Morphological Grammar or Grammaticalizing the Lexicon?
  • Determinization Revisted
Added:
>
>
    • Weighted Generalized Restriction
 
  • Learning a Succinct Inverse of Generalized Restriction
  • Complete Conflict Resolution Scheme for Two-Level Morphology
Added:
>
>
  • Simplified Multi-Tape Transducers for Layered Grammars
  • Cover Techniques for Automata Computations
 


Revision 62008-08-18 - AnssiYliJyra

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 28 to 28
 
  • Determinization Revisted
  • Learning a Succinct Inverse of Generalized Restriction
  • Complete Conflict Resolution Scheme for Two-Level Morphology
Changed:
<
<
>
>
 

Revision 52008-08-18 - AnssiYliJyra

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 28 to 28
 
  • Determinization Revisted
  • Learning a Succinct Inverse of Generalized Restriction
  • Complete Conflict Resolution Scheme for Two-Level Morphology
Added:
>
>
 

Revision 42008-08-07 - AnssiYliJyra

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Line: 13 to 13
 
Added:
>
>

Ideas for New Publications

  • HFST: a Common API between Multiple FST Compilers and Grammar Compilers
  • HFST-TWOLC: Measuring the Performance of Open FST Class Libraries in Rule Compilation and Application
  • HFST-LEXC and HFST-TWOLC: Tools for Open Morphology

Further Research

  • HFST-BETH: Design and Implementation of the Tape Symbol Storage for Advanced FST Compilers
  • HFST-TOKEN: A Compiler for Tokenizer Transducers
  • HFST-MORPH: Compiling the HunMorph Aff-Dic Descriptions into Transducers
  • Revising the Operation of Generalized Restriction
  • Simplified Multi-Tape Transducers for Layered Grammars
  • Lexicalizing the Morphological Grammar or Grammaticalizing the Lexicon?
  • Determinization Revisted
  • Learning a Succinct Inverse of Generalized Restriction
  • Complete Conflict Resolution Scheme for Two-Level Morphology
 
Added:
>
>
 -- KristerLinden - 27 May 2008
Added:
>
>
-- AnssiYliJyra - 07 Aug 2008
 
META TOPICMOVED by="KristerLinden" date="1212070782" from="KitWiki.HFSTPublications" to="KitWiki.HfstPublications"

Revision 32008-07-26 - AnssiYliJyra

Line: 1 to 1
 
META TOPICPARENT name="HfstHome"

HFST: Publications

Articles

Changed:
<
<
>
>
 

Presentations

Revision 22008-05-29 - KristerLinden

Line: 1 to 1
Changed:
<
<
META TOPICPARENT name="HFSTHome"
>
>
META TOPICPARENT name="HfstHome"
 

HFST: Publications

Articles

Line: 16 to 16
 
-- KristerLinden - 27 May 2008
Added:
>
>
META TOPICMOVED by="KristerLinden" date="1212070782" from="KitWiki.HFSTPublications" to="KitWiki.HfstPublications"

Revision 12008-05-27 - KristerLinden

Line: 1 to 1
Added:
>
>
META TOPICPARENT name="HFSTHome"

HFST: Publications

Articles

Presentations


-- KristerLinden - 27 May 2008
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback