Millstream Systems – a Formal Model for Linking Language Modules by Interfaces

We introduce Millstream systems, a formal model consisting of modules and an interface, where the modules formalise different aspects of language, and the interface links these aspects with each other.

[1]  Symeon Bozapalidis,et al.  Weighted Grammars and Kleene's Theorem , 1987, Inf. Process. Lett..

[2]  Henrik Björklund,et al.  Algorithmic Properties of Millstream Systems , 2010, Developments in Language Theory.

[3]  Nilda Ruimy.  Merging two Ontology-based Lexical Resources , 2006, LREC.

[4]  Zoltán Fülöp,et al.  Syntax-Directed Semantics: Formal Models Based on Tree Transducers , 2011 .

[5]  Joost Engelfriet,et al.  Macro Tree Translations of Linear Size Increase are MSO Definable , 2003, SIAM J. Comput..

[6]  Dan Klein,et al.  K-Best A* Parsing , 2009, ACL.

[7]  Heiko Vogler,et al.  Determinization of Weighted Tree Automata Using Factorizations , 2010, J. Autom. Lang. Comb..

[8]  Petr Sgall,et al.  The Meaning Of The Sentence In Its Semantic And Pragmatic Aspects , 1986 .

[9]  Gert Smolka,et al.  Multi-Dimensional Dependency Grammar as Multigraph Description , 2006, FLAIRS Conference.

[10]  Hermann Ney,et al.  Discriminative Training and Maximum Entropy Models for Statistical Machine Translation , 2002, ACL.

[11]  Daniele Pretolani,et al.  Finding the K shortest hyperpaths , 2005, Comput. Oper. Res..

[12]  Raffaella Bernardi,et al.  The Syntactic Process: Language, Speech, and Communication, Mark Steedman , 2004, J. Log. Lang. Inf..

[13]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[14]  Kevin Knight,et al.  An Overview of Probabilistic Tree Transducers for Natural Language Processing , 2005, CICLing.

[15]  Marisa Ulivieri,et al.  Unifying Lexicons in view of a Phonological and Morphological Lexical DB , 2004, LREC.

[16]  Donald E. Knuth,et al.  A Generalization of Dijkstra's Algorithm , 1977, Inf. Process. Lett..

[17]  Dan Klein,et al.  Parsing and Hypergraphs , 2001, IWPT.

[18]  Jean Berstel,et al.  Recognizable Formal Power Series on Trees , 1982, Theor. Comput. Sci..

[19]  Sanjeev Khudanpur,et al.  Variational Decoding for Statistical Machine Translation , 2009, ACL.

[20]  Ralph Debusmann,et al.  Extensible dependency grammar: a modular grammar formalism based on multigraph description , 2006 .

[21]  Claudia Soria,et al.  Lexical Markup Framework (LMF) for NLP Multilingual Resources , 2006 .

[22]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[23]  James W. Thatcher,et al.  Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory , 1967, J. Comput. Syst. Sci..

[24]  Mark Steedman,et al.  The syntactic process , 2004, Language, speech, and communication.

[25]  R. Jackendoff.  Foundations of Language: Brain, Meaning, Grammar, Evolution , 2002 .

[26]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[27]  J. Sadock.  Autolexical Syntax: A Theory of Parallel Grammatical Representations , 1990 .

[28]  Kevin Knight,et al.  Tiburon: A Weighted Tree Automata Toolkit , 2006, CIAA.

[29]  Mary Dalrymple,et al.  Lexical Functional Grammar , 2001 .

[30]  Kevin Knight,et al.  Training Tree Transducers , 2004, NAACL.

[31]  Ivan A. Sag,et al.  Book Reviews: Head-driven Phrase Structure Grammar and German in Head-driven Phrase-structure Grammar , 1996, CL.

[32]  Kevin Knight,et al.  A Better N-Best List: Practical Determinization of Weighted Finite Tree Automata , 2006, NAACL.

[33]  Kathy McKeown,et al.  Integrating a Large-Scale, Reusable Lexicon with a Natural Language Generator , 2000, INLG.

[34]  Joshua Goodman,et al.  Semiring Parsing , 1999, CL.

[35]  Joost Engelfriet,et al.  Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations , 1999, Inf. Comput..

[36]  Marc Kemps-Snijders,et al.  LEXUS, a web-based tool for manipulating lexical resources lexicon , 2006, LREC.

[37]  H. Vogler,et al.  Weighted Tree Automata and Tree Transducers , 2009 .

[38]  Giorgio Satta,et al.  Parsing Algorithms based on Tree Automata , 2009, IWPT.

[39]  Mark-Jan Nederhof,et al.  Squibs and Discussions: Weighted Deductive Parsing and Knuth’s Algorithm , 2003, CL.

[40]  Frank Drewes,et al.  Millstream Systems , 2009 .

[41]  Joost Engelfriet,et al.  MSO definable string transductions and two-way finite-state transducers , 1999, TOCL.

[42]  Frank Drewes,et al.  Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing , 2010, ATANLP@ACL 2010.

[43]  Zoltán Ésik,et al.  Formal Tree Series , 2002, J. Autom. Lang. Comb..