Péter Dienes


Fixing paper assignments

  1. Please select all papers that belong to the same person.
  2. Indicate below which author they should be assigned to.
Provide a valid ORCID iD here. This will be used to match future papers to this author.
Provide the name of the school or the university where the author has received or will receive their highest degree (e.g., Ph.D. institution for researchers, or current affiliation for students). This will be used to form the new author page ID, if needed.

TODO: "submit" and "cancel" buttons here


2005

pdf bib
Aligning Needles in a Haystack: Paraphrase Acquisition Across the Web
Marius Paşca | Péter Dienes
Second International Joint Conference on Natural Language Processing: Full Papers

2003

pdf bib
Deep Syntactic Processing by Combining Shallow Methods
Péter Dienes | Amit Dubey
Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics

pdf bib
Antecedent Recovery: Experiments with a Trace Tagger
Péter Dienes | Amit Dubey
Proceedings of the 2003 Conference on Empirical Methods in Natural Language Processing

2002

pdf bib
Efficient Stochastic Part-of-Speech Tagging for Hungarian
Csaba Oravecz | Péter Dienes
Proceedings of the Third International Conference on Language Resources and Evaluation (LREC’02)

2001

pdf bib
New generation Systran translation system
Jean Senellart | Péter Dienes | Tamás Váradi
Proceedings of Machine Translation Summit VIII

In this paper, we present the design of the new generation Systran translation systems, currently utilized in the development of English-Hungarian, English-Polish, English-Arabic, French-Arabic, Hungarian-French and Polish-French language pairs. The new design, based on the traditional Systran machine translation expertise and the existing linguistic resources, addresses the following aspects: efficiency, modularity, declarativity, reusability, and maintainability. Technically, the new systems rely on intensive use of state-of-the-art finite automaton and formal grammar implementation. The finite automata provide the essential lookup facilities and the natural capacity of factorizing intuitive linguistic sets. Linguistically, we have introduced a full monolingual description of linguistic information and the concept of implicit transfer. Finally, we present some by-products that are directly derived from the new architecture: intuitive coding tools, spell checker and syntactic tagger.

2000

pdf bib
Principled Hidden Tagset Design for Tiered Tagging of Hungarian
Dan Tufiş | Péter Dienes | Csaba Oravecz | Tamás Váradi
Proceedings of the Second International Conference on Language Resources and Evaluation (LREC’00)

pdf bib
Bottom-Up Tagset Design from Maximally Reduced Tagset
Péter Dienes | Csaba Oravecz
Proceedings of the COLING-2000 Workshop on Linguistically Interpreted Corpora