References

  1. Lene Antonsen, Erik Axelson, Eckhard Bick, Børre Gaup, Sam Hardwick, Katri Hiovain-Asikainen, Arvi Hurskainen, Fred Karlsson, Kimmo Koskenniemi, Krister Lindén, Inari Listenmaa, Inga Mikkelsen, Sjur Nørstebø Moshagen, Flammie A Pirinen, Aarne Ranta, Jack Rueter, Daniel G. Swanson, Trond Trosterud & Linda Wiechetek (2023): Rule-Based Language Technology. NEJLT Monographs 2. Northern European Association for Language Technology (NEALT). Available at http://hdl.handle.net/10062/89595.
  2. Andrew Badr (2009): HYPER-MINIMIZATION IN O(n^2). Int. J. Found. Comput. Sci. 20(4), pp. 735–746, doi:10.1142/S012905410900684X.
  3. Laura Banarescu, Claire Bonial, Shu Cai, Madalina Georgescu, Kira Griffitt, Ulf Hermjakob, Kevin Knight, Philipp Koehn, Martha Palmer & Nathan Schneider (2013): Abstract Meaning Representation for Sembanking. In: Proc. 7th Linguistic Annotation Workshop, ACL 2013 Workshop.
  4. Darcy Best & Max Ward (2022): A faster algorithm for maximum independent set on interval filament graphs. J. Graph Algorithms Appl. 26(1), pp. 199–205, doi:10.7155/JGAA.00588.
  5. Johannes Blum & Frank Drewes (2019): Language theoretic properties of regular DAG languages. Inf. Comput. 265, pp. 57–76, doi:10.1016/j.ic.2017.07.011. Available at https://doi.org/10.1016/j.ic.2017.07.011.
  6. Tommaso Boccato, Matteo Ferrante, Andrea Duggento & Nicola Toschi (2024): 4Ward: A relayering strategy for efficient training of arbitrarily complex directed acyclic graphs. Neurocomputing 568, pp. 127058, doi:10.1016/J.NEUCOM.2023.127058.
  7. Dietrich Braess (1968): Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12(1), pp. 258–268, doi:10.1007/BF01918335.
  8. David Chiang, Frank Drewes, Daniel Gildea, Adam Lopez & Giorgio Satta (2018): Weighted DAG Automata for Semantic Graphs. Computational Linguistics 44(1), doi:10.1162/COLI_a_00309.
  9. Marco Damonte & Shay B. Cohen (2018): Cross-lingual Abstract Meaning Representation Parsing. In: Proceedings of NAACL, doi:10.18653/v1/N18-1104.
  10. Marco Damonte, Shay B. Cohen & Giorgio Satta (2017): An Incremental Parser for Abstract Meaning Representation. In: Proceedings of EACL, doi:10.18653/v1/E17-1051.
  11. Martin Dias, Mariano Martinez Peck, Stéphane Ducasse & Gabriela Arévalo (2014): Fuel: a fast general purpose object graph serializer. Softw. Pract. Exp. 44(4), pp. 433–453, doi:10.1002/SPE.2136.
  12. Frank Drewes (2017): DAG Automata for Meaning Representation. In: Makoto Kanazawa, Philippe de Groote & Mehrnoosh Sadrzadeh: Proceedings of the 15th Meeting on the Mathematics of Language, MOL 2017, London, UK, July 13-14, 2017. ACL, pp. 88–99, doi:10.18653/v1/w17-3409.
  13. Frank Drewes (2017): On DAG Languages and DAG Transducers. Bulletin of the EATCS 121.
  14. Senka Drobac, Krister Lindén, Tommi A. Pirinen & Miikka Silfverberg (2014): Heuristic Hyper-minimization of Finite State Lexicons. In: Nicoletta Calzolari, Khalid Choukri, Thierry Declerck, Hrafn Loftsson, Bente Maegaard, Joseph Mariani, Asunción Moreno, Jan Odijk & Stelios Piperidis: Proceedings of the Ninth International Conference on Language Resources and Evaluation, LREC 2014, Reykjavik, Iceland, May 26-31, 2014. European Language Resources Association (ELRA), pp. 3319–3324. Available at http://www.lrec-conf.org/proceedings/lrec2014/summaries/784.html.
  15. Vida Dujmovic & Pat Morin (2019): Dual Circumference and Collinear Sets. In: Gill Barequet & Yusu Wang: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA, LIPIcs 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 29:1–29:17, doi:10.4230/LIPIcs.SoCG.2019.29.
  16. Anjan Dutta, Josep Lladós & Umapada Pal (2013): A symbol spotting approach in graphical documents by hashing serialized graphs. Pattern Recognit. 46(3), pp. 752–768, doi:10.1016/J.PATCOG.2012.10.003.
  17. Krister Lindén Erik Axelson, Sam Hardwick (2023): HFST Training Environment and Recent Additions (61-69) pdf, pp. 60–69 2. In: Hurskainen. Available at http://hdl.handle.net/10062/89595.
  18. Akio Fujiyoshi (2010): Recognition of directed acyclic graphs by spanning tree automata. Theor. Comput. Sci. 411(38-39), pp. 3493–3506, doi:10.1016/j.tcs.2010.06.006.
  19. Abdullah Gharaibeh, Elizeu Santos-Neto, Lauro Beltrão Costa & Matei Ripeanu (2013): Efficient Large-Scale Graph Processing on Hybrid CPU and GPU Systems. CoRR abs/1312.3018. ArXiv:1312.3018.
  20. Annegret Habel & Hans-Jörg Kreowski (1986): May we introduce to you: hyperedge replacement. In: Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg & Azriel Rosenfeld: Graph-Grammars and Their Application to Computer Science, 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986, Lecture Notes in Computer Science 291. Springer, pp. 15–26, doi:10.1007/3-540-18771-5_41.
  21. Tsutomu Kamimura & Giora Slutzki (1981): Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs. Information and Control 49, pp. 10–51, doi:10.1016/S0019-9958(81)90438-1.
  22. Tsutomu Kamimura & Giora Slutzki (1982): Transductions of Dags and Trees. Mathematical Systems Theory 15(3), pp. 225–249, doi:10.1007/BF01786981.
  23. Krister Lindén & Tommi Pirinen (2009): Weighting finite-state morphological analyzers using hfst tools. In: Finite-State Methods and Natural Language Processing-FSMNLP 2009 Eight International Workshop.
  24. Andreas Maletti & Daniel Quernheim (2011): Optimal Hyper-Minimization. Int. J. Found. Comput. Sci. 22(8), pp. 1877–1891, doi:10.1142/S0129054111009094.
  25. Akira Matsubayashi & Yushi Saito (2023): A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess's Paradox. In: Daniele Frigioni & Philine Schiewe: 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2023, September 7-8, 2023, Amsterdam, The Netherlands, OASIcs 115. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 12:1–12:19, doi:10.4230/OASICS.ATMOS.2023.12.
  26. Sjur Nørstebø Moshagen, Flammie Pirinen, Lene Antonsen, Børre Gaup, Inga Mikkelsen, Trond Trosterud, Linda Wiechetek & Katri Hiovain-Asikainen (2023): The GiellaLT infrastructure: A multilingual infrastructure for rule-based NLP 2. In: Hurskainen. Available at http://hdl.handle.net/10062/89595.
  27. Flammie A Pirinen (2023): Finite-State Technology in Rule-Based Natural Language Processing, pp. 49–59 2. In: Hurskainen. Available at http://hdl.handle.net/10062/89595.
  28. Tommi Pirinen & Krister Lindén (2010): Finite-state spell-checking with weighted language and error models. In: Proceedings of LREC 2010 Workshop on Creation and use of basic lexical resources for less-resourced languages.
  29. Daniel Quernheim & Kevin Knight (2012): Towards Probabilistic Acceptors and Transducers for Feature Structures. In: Proc. 6th Workshop on Syntax, Semantics and Structure in Statistical Translation. Association for Computational Linguistics, pp. 76–85.
  30. Eloize Rossi Marques Seno, Helena de Medeiros Caseli, Marcio Lima Inácio, Rafael T. Anchiêta & Renata Ramisch (2022): XPTA: um parser AMR para o Português baseado em uma abordagem entre línguas. Linguamática 14(1), pp. 49–68, doi:10.21814/lm.14.1.359.
  31. Daniel G. Swanson (2023): Apertium, pp. 95–111 2. In: Hurskainen. Available at http://hdl.handle.net/10062/89595.
  32. Ieva Vasiljeva, Sorcha Gilroy & Adam Lopez (2018): The problem with probabilistic DAG automata for semantic graphs. CoRR abs/1810.12266. ArXiv:1810.12266.
  33. Magnus Wahlström (2017): LP-branching algorithms based on biased graphs. In: Philip N. Klein: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. SIAM, pp. 1559–1570, doi:10.1137/1.9781611974782.102.
  34. Douglas B. West (2001): Introduction to Graph Theory, 2 edition. Prentice Hall.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org